Solving shortest path problems with a weight constraint and replenishment arcs
- 31 May 2012
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 39 (5), 964-984
- https://doi.org/10.1016/j.cor.2011.07.017
Abstract
No abstract availableFunding Information
- ARC (LP0669824)
- ARC (LP0883855)
This publication has 29 references indexed in Scilit:
- Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problemNetworks, 2009
- Wide area telecommunication network design: application to the Alberta SuperNetJournal of the Operational Research Society, 2008
- Lagrangian relaxation and enumeration for solving constrained shortest‐path problemsNetworks, 2008
- The network design problem with relaysEuropean Journal of Operational Research, 2007
- Accelerated label setting algorithms for the elementary resource constrained shortest path problemOperations Research Letters, 2006
- Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path ProblemNetworks, 2003
- Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcsInternational Transactions in Operational Research, 2000
- The asymmetric traveling salesman problem with replenishment arcsEuropean Journal of Operational Research, 2000
- Crew pairing at Air FranceEuropean Journal of Operational Research, 1997
- Locomotive assignment with heterogeneous consists at CN North AmericaEuropean Journal of Operational Research, 1997