The search-and-remove algorithm for biobjective mixed-integer linear programming problems
Year of publication: |
1 July 2018
|
---|---|
Authors: | Soylu, Banu |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 268.2018, 1 (1.7.), p. 281-299
|
Subject: | Multiple objective programming | Biobjective mixed-integer linear programming | Integer programming | Bound sets | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Cerqueus, Audrey, (2015)
-
Multi-objective branch and bound
Przybylski, Anthony, (2017)
-
Dynamic programming algorithms for the bi-objective integer knapsack problem
Rong, Aiying, (2014)
- More ...
-
A multi-criteria sorting procedure with Tchebycheff utility function
Soylu, Banu, (2011)
-
A preference ordered clasification for a multi-objective max-min redundancy allocation problem
Soylu, Banu, (2011)
-
Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
Soylu, Banu, (2015)
- More ...