Publications

Journal articles

• Q. Mu, Z. Fu, J. Lysgaard & R. Eglese (2010): "Disruption management of the vehicle routing problem with vehicle breakdown", to appear in Journal of the Operational Research Society. Published online at Palgrave Macmillan in April 2010. Copyright Palgrave Macmillan.
• J. Lysgaard (2010): "The Pyramidal Capacitated Vehicle Routing Problem", European Journal of Operational Research, vol. 205, pp. 59-64. Published online at Elsevier B.V. in December 2009. Copyright Elsevier B.V.
• G. Brønmo, B. Nygreen & J. Lysgaard (2010): "Column generation approaches to ship scheduling with flexible cargo sizes", European Journal of Operational Research, vol. 200, pp. 139-150. Published online at Elsevier B.V. in January 2009. Copyright Elsevier B.V.
• C.H. Christiansen, J. Lysgaard & S. Wøhlk (2009): "A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands", Operations Research Letters, vol. 37, pp. 392-398. Published online at Elsevier B.V. in June 2009. Copyright Elsevier B.V.
• 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, pp. 443-472. Click here to download. Published online at Springer-Verlag in October 2006. Copyright Springer-Verlag.
• 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. Click here to download. Published online at Palgrave Macmillan in December 2006. Copyright Palgrave Macmillan.
• C.H. Christiansen & J. Lysgaard (2007): "A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands", Operations Research Letters, vol. 35, pp. 773-781. Published online at Elsevier B.V. in February 2007. Copyright Elsevier B.V.
• J. Lysgaard (2006): "Reachability cuts for the vehicle routing problem with time windows", European Journal of Operational Research, vol. 175, pp. 210-223. Click here to download. Published online at Elsevier B.V. in June 2005. Copyright Elsevier B.V.
• 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. Click here to download. Published online at Springer-Verlag in October 2005. Copyright Springer-Verlag.
• 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. Click here to download. Copyright Springer-Verlag.
• A.N. Letchford, R.W. Eglese & J. Lysgaard (2002): "Multistars, partial multistars and the capacitated vehicle routing problem", Mathematical Programming, vol. 94, no. 1, pp. 21-40.
• J. Lysgaard (1999): "Cluster based branching for the asymmetric traveling salesman problem", European Journal of Operational Research, vol. 119, pp. 314-325.
• J. Lysgaard (1995): "A two-phase shortest path algorithm for networks with node coordinates", European Journal of Operational Research, vol. 87, pp. 368-374.
• J. Lysgaard (1992): "Dynamic Transportation Networks in Vehicle Routing and Scheduling", Interfaces, vol. 22, no. 3, pp. 45-55.
  

Book articles

• R. Fukasawa, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa & R.F. Werneck (2004): "Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem". In G. Nemhauser & D. Bienstock (Eds.): Integer Programming and Combinatorial Optimization, proceedings of the 10th International IPCO Conference, New York, USA, June 7-11, 2004. Lecture Notes in Computer Science, Vol. 3064. Click here to download. Copyright Springer-Verlag.
  

Conference presentations

• J. Lysgaard (2009): "The Pyramidal Capacitated Vehicle Routing Problem", presented at the 3rd Nordic Optimization Symposium, March 13-14, Stockholm, Sweden.
• J. Lysgaard & J. Løber (2007): "Scheduling exercises of an assessment centre", presented at the 2nd Nordic Optimization Symposium, October 18-20, Oslo, Norway.
• J. Lysgaard, A.N. Letchford & R.W. Eglese (2006): "A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem", presented at the 1st Nordic Optimization Symposium (10th Nordic MPS Meeting), April 20-22, Copenhagen, Denmark.
• J. Lysgaard (2005): "Reachability Cuts for the Vehicle Routing Problem with Time Windows", presented at IFORS 2005, July 11-15, Hawaii, USA.
• J. Lysgaard (2003): "Exact solution of the CVRP for a given set of seed customers: a branch-and-bound approach", presented at ISMP 2003, August 18-22, Copenhagen, Denmark.
• J. Lysgaard (2002): "Optimizing vehicle routes with non-additive costs: A case study", presented at IFORS 2002, July 8-12, Edinburgh, Scotland.
• J. Lysgaard, A.N. Letchford & R.W. Eglese (2000): "A Branch and Cut algorithm for the Vehicle Routing Problem", presented at CO2000, July 12-14, Greenwich, London, England.
• J. Lysgaard, A.N. Letchford & R.W. Eglese (1999): "A Branch and Cut algorithm for the Vehicle Routing Problem", presented at Symposium on Operations Research, September 1-3, Magdeburg, Germany.
• J. Lysgaard, A.N. Letchford & R.W. Eglese (1999): "New Procedures in Branch and Cut for the Vehicle Routing Problem", presented at IFORS 1999, August 16-20, Beijing, China.
• J. Lysgaard (1998): "Application of Set Partitioning to a Real-World Vehicle Routing Problem",  in Proceedings of the 10th Annual Nordic Logistics Conference, June 9-10, Espoo, Finland.
• J. Lysgaard (1997): "Cluster based branching for the asymmetric traveling salesman problem", presented at EURO XV / INFORMS XXXIV Joint International Conference, July 14-17, Barcelona, Spain.
  

Working papers

• J. Lysgaard (2008): "The Pyramidal Capacitated Vehicle Routing Problem", Working Paper L-2008-02, CORAL – Centre for Operations Research Applications in Logistics, Dept. of Business Studies, Aarhus School of Business, University of Aarhus. The paper can be downloaded here.
• J. Lysgaard & J. Løber (2008): "Scheduling participants of Assessment Centres", Working Paper L-2008-01, CORAL – Centre for Operations Research Applications in Logistics, Dept. of Business Studies, Aarhus School of Business, University of Aarhus. The paper can be downloaded here.
• E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. Poggi de Aragão & D. Andrade (2006): "Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation", Working Paper L-2006-08, Logistics/SCM Research Group, Dept. of Business Studies, Aarhus School of Business. The paper can be downloaded here.
• G. Brønmo, B. Nygreen & J. Lysgaard (2006): "Column generation approaches to ship scheduling with flexible cargo sizes", Working Paper L-2006-07, Logistics/SCM Research Group, Dept. of Business Studies, Aarhus School of Business. The paper can be downloaded here.
• A.N. Letchford, J. Lysgaard & R.W. Eglese (2006): "A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem", Working Paper L-2006-06, Logistics/SCM Research Group, Dept. of Business Studies, Aarhus School of Business. The paper can be downloaded here.
• C.H. Christiansen & J. Lysgaard (2006): "A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands", Working Paper L-2006-04, Logistics/SCM Research Group, Dept. of Business Studies, Aarhus School of Business. The paper can be downloaded here.
• J. Lysgaard (2004): "Reachability Cuts for the Vehicle Routing Problem with Time Windows", Working Paper L-2004-01, Logistics/SCM Research Group, Dept. of Accounting, Finance and Logistics, Aarhus School of Business. The paper can be downloaded here.
• J. Lysgaard (2003):  "CVRPSEP: A package of separation routines for the Capacitated Vehicle Routing Problem", Working Paper 03-04, Dept. of Mgt. Science and Logistics, Aarhus School of Business.
• J. Lysgaard (2002):  "Allocating customers to routes with zone costs: A case study", Working Paper 02-05, Dept. of Mgt. Science and Logistics, Aarhus School of Business.
• J. Lysgaard (1998): "Application of Set Partitioning to a Real-World Vehicle Routing Problem", Working Paper 98-1, Dept. of Mgt. Science and Logistics, Aarhus School of Business.
• J. Lysgaard (1997): "Cluster Based Branching for the Asymmetric Traveling Salesman Problem", Working Paper 97-1, Dept. of Mgt. Science and Logistics, Aarhus School of Business.
• J. Lysgaard (1996): "Subtour Elimination by Artificial Nodes for the Asymmetric Traveling Salesman Problem", Working Paper 96-1, Dept. of Mgt. Science and Logistics, Aarhus School of Business.
• J. Lysgaard (1995): "The Two-Routes Problem for the symmetric Traveling Salesman Problem: Identification of an optimal pair of special nodes", Working Paper 95-2, Dept. of Mgt. Science, Aarhus School of Business.
• J. Lysgaard (1995): "New Bounding Procedures for the Restricted Lagrangean Approach to the Traveling Salesman Problem", Working Paper 95-1, Dept. of Mgt. Science, Aarhus School of Business.
• J. Lysgaard (1993): "A Two-Phase Shortest Path Algorithm for Networks with Node Coordinates", Working Paper 93-1, Dept. of Mgt. Science, Aarhus School of Business.
  

Last update: April 22, 2010