A Branch & Cut algorithm to compute nondominated solutions in MOLFP via reference points
Year of publication: |
2011
|
---|---|
Authors: | Costa, João Paulo ; Alves, Maria João |
Published in: |
Operations research proceedings 2010 : selected papers of the annual International Conference of the German Operations Research Society (GOR) at Universität der Bundeswehr München, September 1 - 3, 2010. - Berlin : Springer, ISBN 3-642-20008-7. - 2011, p. 353-358
|
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
An exact method for computing the nadir values in multiple objective linear programming
Alves, Maria João, (2009)
-
Graphical exploration of the weight space in three-objective mixed integer linear programs
Alves, Maria João, (2016)
-
An exact method for computing the nadir values in multiple objective linear programming
Alves, Maria João, (2009)
- More ...