Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs. / Forget, Nicolas Joseph; Gadegaard, Sune Lauth; Relund, Lars.
In: European Journal of Operational Research, Vol. 302, No. 1, 11.2022, p. 909-924.Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review
A symmetry-free polynomial formulation of the capacitated vehicle routing problem. / Gadegaard, S. L.; Lysgaard, J.
In: Discrete Applied Mathematics, Vol. 296, 06.2021, p. 179-192.Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review
Branch-and-bound and objective branching with three objectives. / Gadegaard, Sune Lauth; Relund, Lars; Forget, Nicolas Joseph et al.
In: optimization-online.org, 12.2020.Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research
Kan man regne sig frem til bedre normeringer i børnehaver? / Gadegaard, Sune Lauth; Desmorais Salomonsen, Helle.
In: Videnskab.dk [online], 31.08.2020.Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Contribution to newspaper - Comment/debate › Communication
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets. / Gadegaard, Sune Lauth; Nielsen, Lars Relund; Ehrgott, Matthias.
In: INFORMS Journal on Computing, Vol. 31, No. 4, 2019, p. 790-804.Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review
A bi-objective approach to discrete cost-bottleneck location problems. / Gadegaard, Sune Lauth; Klose, Andreas; Nielsen, Lars Relund.
In: Annals of Operations Research, Vol. 267, No. 1-2, 2018, p. 179-201.Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review
An improved cut-and-solve algorithm for the single-source capacitated facility location problem. / Gadegaard, Sune Lauth; Klose, Andreas; Nielsen, Lars Relund.
In: EURO Journal on Computational Optimization, Vol. 6, No. 1, 2018, p. 1-27.Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review
A solver for the single source capacitated facility location problem. / Gadegaard, Sune Lauth; Klose, Andreas; Nielsen, Lars Relund.
GitHub. 2017.Research output: Other contribution › Net publication - Internet publication › Research
Discrete Location Problems – Theory, Algorithms, and Extensions to Multiple Objectives. / Gadegaard, Sune Lauth.
Århus : Institut for Økonomi, Aarhus Universitet, 2016. 150 p. (ECON PhD Dissertations; No. 2016-11).Research output: Book/anthology/dissertation/report › Ph.D. thesis
Code for generating instances of the single source capacitated facility location problem. / Gadegaard, Sune Lauth; Nielsen, Lars Relund; Ehrgott, Matthias.
2016.Research output: Book/anthology/dissertation/report › Report
Bi-objective branch-and-cut algorithms : Applications to the single source capacitated facility location problem. / Gadegaard, Sune Lauth; Ehrgott, Matthias; Nielsen, Lars Relund.
Aarhus Universitet, 2016.Research output: Working paper/Preprint › Working paper › Research
Integrating cut-and-solve and semi-Lagrangean based dual ascent for the single-source capacitated facility location problem. / Gadegaard, Sune Lauth.
Department of Economics and Business Economics, School of Business and Social Sciences, Aarhus University, 2016.Research output: Working paper/Preprint › Working paper › Research
Balancing efficiency and equity. / Gadegaard, Sune Lauth.
In: ORbit, No. 24, 04.2015, p. 13.Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Communication