Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs

•Develops a branch-and-bound algorithm for multi-objective integer problems.•Uses the linear relaxation as a lower bound set in the algorithm.•Warm-starts the linear relaxation using information from the father node.•Warm-starting the linear relaxation improves efficiency considerably.•Reports exten...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 302; číslo 3; s. 909 - 924
Hlavní autori:	Forget, Nicolas, Gadegaard, Sune Lauth, Nielsen, Lars Relund
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.11.2022
Predmet:	Branch and bound Combinatorial optimization Linear relaxation Multiple objective programming Warm-starting Warm-starting Linear relaxation Branch and bound Combinatorial optimization Multiple objective programming
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!