Multi-objective branch and bound
Year of publication: |
1 August 2017
|
---|---|
Authors: | Przybylski, Anthony ; Gandibleux, Xavier |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 260.2017, 3 (1.8.), p. 856-872
|
Subject: | Multiple objective programming | Branch and bound | Bound sets | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Cerqueus, Audrey, (2015)
-
The search-and-remove algorithm for biobjective mixed-integer linear programming problems
Soylu, Banu, (2018)
-
Branch-and-bound and objective branching with three or more objectives
Forget, Nicolas, (2022)
- More ...
-
Two phase algorthms for the bi-objective assignment problem
Przybylski, Anthony, (2008)
-
Przybylski, Anthony, (2010)
-
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Cerqueus, Audrey, (2015)
- More ...