Multiple objective branch and bound for mixed 0-1 linear programming : corrections and improvements for the biojective case
Year of publication: |
2013
|
---|---|
Authors: | Vincent, Thomas ; Seipp, Florian ; Ruzika, Stefan ; Przybylski, Anthony ; Gandibleux, Xavier |
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. 40.2013, 1, p. 498-509
|
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Optimal proactive monitor placement & scheduling for IoT networks
Mostafa, Basma, (2022)
-
Eirinakis, Pavlos, (2024)
-
A hybrid ANN-MILP model for agile recovery production planning for PPE products under sharp demands
Babazadeh, Reza, (2025)
- More ...
-
Przybylski, Anthony, (2010)
-
Computational results for four exact methods to solve the three-objective assignment problem
Przybylski, Anthony, (2009)
-
Exact methode for multi-objective combinatorial optimisation
Ehrgott, Matthias, (2016)
- More ...