Sune Lauth Gadegaard

Publication Activity (10 Years)

Years Active: 2018-2022
Publications (10 Years): 6

Top Topics

Location Problems

Top Venues

Ann. Oper. Res.

Comput. Oper. Res.

Discret. Appl. Math.

INFORMS J. Comput.

Publications

Nicolas Forget, Sune Lauth Gadegaard, Kathrin Klamroth, Lars Relund Nielsen, Anthony Przybylski
Branch-and-bound and objective branching with three or more objectives. Comput. Oper. Res. 148 (2022)
Nicolas Forget, Sune Lauth Gadegaard, Lars Relund Nielsen
Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs. Eur. J. Oper. Res. 302 (3) (2022)
Sune Lauth Gadegaard, Jens Lysgaard
A symmetry-free polynomial formulation of the capacitated vehicle routing problem. Discret. Appl. Math. 296 (2021)
Sune Lauth Gadegaard, Lars Relund Nielsen, Matthias Ehrgott
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets. INFORMS J. Comput. 31 (4) (2019)
Sune Lauth Gadegaard, Andreas Klose, Lars Relund Nielsen
A bi-objective approach to discrete cost-bottleneck location problems. Ann. Oper. Res. 267 (1-2) (2018)
Sune Lauth Gadegaard, Andreas Klose, Lars Relund Nielsen
An improved cut-and-solve algorithm for the single-source capacitated facility location problem. EURO J. Comput. Optim. 6 (1) (2018)