Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
Year of publication: |
2022
|
---|---|
Authors: | Forget, Nicolas ; Gadegaard, Sune Lauth ; Nielsen, Lars Relund |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 302.2022, 3 (1.11.), p. 909-924
|
Subject: | Branch and bound | Combinatorial optimization | Linear relaxation | Multiple objective programming | Warm-starting | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Branch-and-Bound | Branch and Bound |
-
Zhang, Yurong, (2025)
-
Morrison, David Robert, (2014)
-
Lower bounds for a bin packing problem with linear usage cost
Braune, Roland, (2019)
- More ...
-
Branch-and-bound and objective branching with three or more objectives
Forget, Nicolas, (2022)
-
A bi-objective approach to discrete cost-bottleneck location problems
Gadegaard, Sune Lauth, (2018)
-
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Gadegaard, Sune Lauth, (2019)
- More ...