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

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 302; no. 3; pp. 909 - 924
Main Authors:	Forget, Nicolas, Gadegaard, Sune Lauth, Nielsen, Lars Relund
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.11.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!