An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
Year of publication: |
2014
|
---|---|
Authors: | Belhoul, Lyes ; Galand, Lucie ; Vanderpooten, Daniel |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 49.2014, p. 97-106
|
Subject: | Multi-objective assignment problem | Compromise solutions | Branch and bound | k-best algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis |
-
Böðvarsdóttir, Elín Björk, (2021)
-
Multi-objective branch and bound
Przybylski, Anthony, (2017)
-
Pinto, F. S., (2015)
- More ...
-
Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée
Belhoul, Lyes, (2014)
-
A branch and bound algorithm for choquet optimization in multicriteria problems
Galand, Lucie, (2010)
-
Choquet-based optimisation in multiobjective shortest path and spanning tree problems
Galand, Lucie, (2010)
- More ...