Search Results - subject:"Bound sets"

Branch-and-bound and objective branching with three or more objectives

Forget, Nicolas; Gadegaard, Sune Lauth; Klamroth, Kathrin; … - In: Computers & operations research : and their … 148 (2022), pp. 1-16

Persistent link: https://www.econbiz.de/10013483596

Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective

Artigues, Christian; Jozefowiez, Nicolas; Sarpong, Boadu M. - In: EURO journal on computational optimization 6 (2018) 2, pp. 117-142

Persistent link: https://www.econbiz.de/10011964477

The search-and-remove algorithm for biobjective mixed-integer linear programming problems

Soylu, Banu - In: European journal of operational research : EJOR 268 (2018) 1, pp. 281-299

Persistent link: https://www.econbiz.de/10011813070

Multi-objective branch and bound

Przybylski, Anthony; Gandibleux, Xavier - In: European journal of operational research : EJOR 260 (2017) 3, pp. 856-872

Persistent link: https://www.econbiz.de/10011714239

Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems

Cerqueus, Audrey; Przybylski, Anthony; Gandibleux, Xavier - In: European journal of operational research : EJOR 244 (2015) 2, pp. 417-433

Persistent link: https://www.econbiz.de/10010531907

Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems

Sarpong, Boadu Mensah; Artigues, Christian; Jozefowiez, … - In: RAIRO 49 (2015) 3, pp. 527-554

Persistent link: https://www.econbiz.de/10011509376

Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems

Cerqueus, Audrey; Przybylski, Anthony; Gandibleux, Xavier - In: European Journal of Operational Research 244 (2015) 2, pp. 417-433

The paper deals with the definition and the computation of surrogate upper bound sets for the bi-objective bi … dominance relations between bound sets. Based on the improved exact algorithm, an approximated version is derived. The proposed …

Persistent link: https://www.econbiz.de/10011209318

Dynamic programming algorithms for the bi-objective integer knapsack problem

Rong, Aiying; Figueira, José Rui - In: European journal of operational research : EJOR 236 (2014) 1, pp. 85-99

Persistent link: https://www.econbiz.de/10010361770

Dynamic programming algorithms for the bi-objective integer knapsack problem

Rong, Aiying; Figueira, José Rui - In: European Journal of Operational Research 236 (2014) 1, pp. 85-99

approach using the concept of the bound sets. The property is used in conjunction with the bound sets. Next, the numerical …

Persistent link: https://www.econbiz.de/10010753483