| An improved cut-and-solve algorithm for the single-source capacitated facility location problem SL Gadegaard, A Klose, LR Nielsen EURO Journal on Computational Optimization 6 (1), 1-27, 2018 | 39 | 2018 |
| Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets SL Gadegaard, LR Nielsen, M Ehrgott INFORMS Journal on Computing 31 (4), 790-804, 2019 | 22 | 2019 |
| Branch-and-bound and objective branching with three or more objectives N Forget, SL Gadegaard, K Klamroth, LR Nielsen, A Przybylski Computers & Operations Research 148, 106012, 2022 | 12 | 2022 |
| Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs N Forget, SL Gadegaard, LR Nielsen European Journal of Operational Research 302 (3), 909-924, 2022 | 12 | 2022 |
| A bi-objective approach to discrete cost-bottleneck location problems SL Gadegaard, A Klose, LR Nielsen Annals of Operations Research 267 (1), 179-201, 2018 | 12 | 2018 |
| Discrete Location Problems–Theory, Algorithms, and Extensions to Multiple Objectives SL Gadegaard Institut for Økonomi, Aarhus Universitet, 2016 | 10 | 2016 |
| A symmetry-free polynomial formulation of the capacitated vehicle routing problem SL Gadegaard, J Lysgaard Discrete Applied Mathematics 296, 179-192, 2021 | 9 | 2021 |
| Branch-and-bound and objective branching with three objectives N Forget, K Klamroth, SL Gadegaard, A Przybylski, LR Nielsen Preprint. Dec, 2020 | 4 | 2020 |
| Computational results (all instances) N Forget, LR Nielsen, SL Gadegaard Technical Report, 2020 | 4 | 2020 |
| Bi-objective branch-and-cut algorithms: Applications to the single source capacitated facility location problem SL Gadegaard, M Ehrgott, LR Nielsen Working paper, Aarhus Universitet, 2016 | 3 | 2016 |
| A Branch-and-Cut Algorithm for the Mixed Fleet Green Vehicle Routing Problem JB Mikkelsen, SL Gadegaard, J Lysgaard | | 2023 |
| Introduktion til Modellering inden for Prescriptive Analytics SL Gadegaard | | 2023 |
| Branch-and-bound and objective branching with three or more objectives N Forget, SL Gadegaard, K Klamroth, LR Nielsen, A Przybylski Computers & Operations Research 148, 106012, 2022 | | 2022 |
| Linear relaxation based branch-and-bound for multi-objective integer programming with warm-starting N Forget, SL Gadegaard, LR Nielsen | | 2021 |
| Branch-and-bound and objective branching with three objectives SL Gadegaard, L Relund, NJ Forget, K Klamroth, A Przybylski optimization-online. org, 2020 | | 2020 |
| Kan man regne sig frem til bedre normeringer i børnehaver? SL Gadegaard, HD Salomonsen Videnskab. dk [online], 2020 | | 2020 |
| A solver for the single source capacitated facility location problem. SL Gadegaard, A Klose, LR Nielsen | | 2017 |
| Integrating cut–and–solve and semi–Lagrangean based dual ascent for the single source capacitated facility location problem SL Gadegaard | | 2016 |
| Code for generating instances of the single source capacitated facility location problem SL Gadegaard, LR Nielsen, M Ehrgott | | 2016 |
| Balancing efficiency and equity SL Gadegaard ORbit, 13, 2015 | | 2015 |
Lars Relund NielsenProfessor, Aarhus UniversityDirección de correo verificada de econ.au.dk
