An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
Lyes Belhoul; Lucie Galand; Daniel Vanderpooten
| 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 | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10010383153