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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 302; H. 3; S. 909 - 924
Hauptverfasser:	Forget, Nicolas, Gadegaard, Sune Lauth, Nielsen, Lars Relund
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.11.2022
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!