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 | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung |
-
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Cerqueus, Audrey, (2015)
-
Dynamic programming algorithms for the bi-objective integer knapsack problem
Rong, Aiying, (2014)
-
Branch-and-bound and objective branching with three or more objectives
Forget, Nicolas, (2022)
- More ...
-
Bicriteria p-hub location problems and evolutionary algorithms
Köksalan, Murat, (2010)
-
A multiobjective post-sales guarantee and repair services network design problem
Yıldız, Gazi Bilal, (2019)
-
INTEGRATING PROMETHEEII WITH THE TCHEBYCHEFF FUNCTION FOR MULTI CRITERIA DECISION MAKING
SOYLU, BANU, (2010)
- More ...