Jens Lysgaard

Professor

PhD, MSc (cand.merc.) 

Research interests

• Logistics
• Vehicle routing
• Optimization and heuristics

Teaching

• Logistics
• Vehicle routing
• Management science

Selected publications

• E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. Poggi de Aragão & D. Andrade (2008): "Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation", Mathematical Programming, vol. 112, no 2, 443-472.
• Christiansen, Christian H.; Lysgaard, Jens (2007): A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands, Operations Research Letters, vol 35, pp 773-781, 2007.
• A.N. Letchford, J. Lysgaard, R.W. Eglese (2007): "A branch-and-cut algorithm for the capacitated open vehicle routing problem", Journal of the Operational Research Society, vol 58, pp 1642-1651.  
    
• J. Lysgaard (2006): "Reachability cuts for the vehicle routing problem with time windows", European Journal of Operational Research, vol 175, pp 210-233.
• R. Fukasawa, H. Longo, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa & R.F. Werneck (2006): "Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem", Mathematical Programming, vol 106, pp 491-511.
• J. Lysgaard, A.N. Letchford & R.W. Eglese (2004): "A new branch-and-cut algorithm for the capacitated vehicle routing problem", Mathematical Programming, vol 100, no 2, pp 423-445.

• Various projects in vehicle routing, optimization, and heuristics.