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

von Forget, Nicolas
Veröffentlicht in European journal of operational research (2022)

A bi-objective approach to discrete cost-bottleneck location problems

von Gadegaard, Sune Lauth
Veröffentlicht in International Conference on Multiple Objective Programming and Goal Programming (11. : 2015 : Tlemcen) Managerial multiple objective optimization (2018)

Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets

von Gadegaard, Sune Lauth
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2019)

An improved cut-and-solve algorithm for the single-source capacitated facility location problem

von Gadegaard, Sune Lauth
Veröffentlicht in EURO journal on computational optimization (2018)

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

von Forget, Nicolas
Veröffentlicht in Computers & operations research (2022)