Sune Lauth Gadegaard

About the "academic me"

I am an associate professor in operations research at Aarhus University. My background is originally from pure math, but I did my master's in operations research and continued with a Ph.d. in the same topic.

My main research interests are focussed on general solution methods for multi-objective optimisation (e.g. branch and bound for general integer MO problems with an arbitrary number of objectives), optimisation problems tailored to small application areas (e.g. optimising workforce schedules in Danish kindergartens), general routing problems (e.g. formulations for the CVRP) as well as insights into how logistics can become "greener" (e.g. routing when cities implement green zones). Hence, my research interests range from the very general to the very specific.

My pratical side loves solving difficult problems using the techniques we know and to see the solutions being used.

My background in math leads me to seek the "truths" behind the fact that some methods work and others don't. That is, I want proofs and deeper insights, which often lead to new methods and techniques.

Hence, I apply known methods from the field of operations research to specific problems, then I become curious as to why a method work or doesn't. Curiosity then leads me to investigate further, and once in a while new techniques appear.

I am an experienced programmer in C++ (apparently, I am a dinosaur) but I have seen the meteor and I have recently become rather fond of Python as well.

You can find my CV here.

Publications

The following is a list of my scientific publications

• N. Forget, S.L. Gadegaard, L.R. Nielsen, K. Klamroth, and A. Przybylski, Branch-and-bound and objective branching with three or more objectives, Computers & Operations Research, December 2022. 

  • Abstracts | doi | code 

• N. Forget, S.L. Gadegaard, and L.R. Nielsen, Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs, European Journal of Operational Research, November 2022.

  • Abstracts | doi | code

•  S.L. Gadegaard and J. Lysgaard, A symmetry-free polynomial formulation of the Capacitated Vehicle Routing Problem, Discrete Applied Mathematics, June 2021.

  • Abstracts | doi

• S.L. Gadegaard, L.R. Nielsen, and M: Ehrgott, Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets, INFORMS Journal on Computing, June 2019.

  • Abstracts | doi | code

• S.L. Gadegaard, A. Klose, L.R. Nielsen, An improved cut–and–solve algorithm for the single source capacitated facility location problem, EURO Journal on Computational Optimization, March 2018.

  • Abstracts | doi | code 

• S.L. Gadegaard, A. Klose, and L.R. Nielsen, A bi-objctive approach to discrete cost-bottlenect location problems, Annals of Operations Research, 2018

  • Abstracts | doi | code

• S.L. Gadegaard, Discrete Location Problems - Theory, Algorithms, and Extensions to Multiple Objectives, PhD dissertation, Department of Economics and Business Economics, June 2016

  • Abstracts | Link

• S.L. Gadegaard, Integrating cut-and-solve and semi-Lagrangean dual ascent for the single-source capacitated facility location problem, www.optimization-online.org, April 2016

  • Abstracts | Link

Works in progress

• J. Lysgaard and S.L. Gadegaard, A Set Partitioning Model for MinMax Vehicle Routing

• J.B. Mikkelsen, S.L. Gadegaard, and J. Lysgaard, A Branch-and-Cut Algorithm for the Mixed Fleet Green Vehicle Routing Problem

• M. Lyngesen and S.L. Gadegaard, Finding all efficient solutions to a bi-objective combinatorial optimization problem using boundset based branch-and-bound

Teaching

I give teaching, and the planning and development thereof, high priority in my daily work. I have developed the literature for several courses as well as electronic teaching material in order to increase student learning. I genuinely enjoy teaching and look forward to all (maybe not all, but most) of my confrontation hours with my students. You can see more about my teaching under Teaching.