Jens Lysgaard

Orcid: 0000-0001-7835-136X

According to our database1, Jens Lysgaard authored at least 22 papers between 1999 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The cumulative school bus routing problem: Polynomial-size formulations.
Networks, December, 2023

2021
Solving the service-oriented single-route school bus routing problem: Exact and heuristic solutions.
EURO J. Transp. Logist., 2021

A symmetry-free polynomial formulation of the capacitated vehicle routing problem.
Discret. Appl. Math., 2021

2020
A matheuristic for the MinMax capacitated open vehicle routing problem.
Int. Trans. Oper. Res., 2020

2016
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem.
Networks, 2016

2015
Optimal vehicle routing with lower and upper bounds on route durations.
Networks, 2015

The offshore wind farm array cable layout problem: a planar open vehicle routing problem.
J. Oper. Res. Soc., 2015

2014
A dynamic programming algorithm for the space allocation and aisle positioning problem.
J. Oper. Res. Soc., 2014

A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem.
Eur. J. Oper. Res., 2014

2011
Disruption management of the vehicle routing problem with vehicle breakdown.
J. Oper. Res. Soc., 2011

2010
The pyramidal capacitated vehicle routing problem.
Eur. J. Oper. Res., 2010

Column generation approaches to ship scheduling with flexible cargo sizes.
Eur. J. Oper. Res., 2010

2009
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands.
Oper. Res. Lett., 2009

2008
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.
Math. Program., 2008

2007
A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands.
Oper. Res. Lett., 2007

A branch-and-cut algorithm for the capacitated open vehicle routing problem.
J. Oper. Res. Soc., 2007

2006
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.
Math. Program., 2006

Reachability cuts for the vehicle routing problem with time windows.
Eur. J. Oper. Res., 2006

2004
A new branch-and-cut algorithm for the capacitated vehicle routing problem.
Math. Program., 2004

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2002
Multistars, partial multistars and the capacitated vehicle routing problem.
Math. Program., 2002

1999
Cluster based branching for the asymmetric traveling salesman problem.
Eur. J. Oper. Res., 1999


  Loading...