A bi-objective approach to discrete cost-bottleneck location problems. - Sune Lauth Gadegaard; Andreas Klose; Lars Relund Nielsen (Ann. Oper. Res., 2018)

An improved cut-and-solve algorithm for the single-source capacitated facility location problem. - Sune Lauth Gadegaard; Andreas Klose; Lars Relund Nielsen (EURO J. Comput. Optim., 2018)

Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets. - Sune Lauth Gadegaard; Lars Relund Nielsen; Matthias Ehrgott (INFORMS J. Comput., 2019)

A symmetry-free polynomial formulation of the capacitated vehicle routing problem. - Sune Lauth Gadegaard; Jens Lysgaard (Discret. Appl. Math., 2021)

Branch-and-bound and objective branching with three or more objectives. - Nicolas Forget; Sune Lauth Gadegaard; Kathrin Klamroth; Lars Relund Nielsen; Anthony Przybylski (Comput. Oper. Res., 2022)

Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs. - Nicolas Forget; Sune Lauth Gadegaard; Lars Relund Nielsen (Eur. J. Oper. Res., 2022)