Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
Authors:
- Christian TilkCTChristian Tilk
- Ann-Kathrin RothenbächerARAnn-Kathrin Rothenbächer
- Timo GschwindTGTimo Gschwind
- Stefan IrnichSIStefan Irnich
- 1 September 2017
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 261 (2) , 530-539
Abstract
No abstract availableFunding Information
- PUC
This publication has 25 references indexed in Scilit:
- On an exact method for the constrained shortest path problemComputers & Operations Research, 2013
- Rich vehicle routing in theory and practiceLogistics Research, 2012
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraintsEuropean Journal of Operational Research, 2012
- New Route Relaxation and Pricing Strategies for the Vehicle Routing ProblemOperations Research, 2011
- New dynamic programming algorithms for the resource constrained elementary shortest path problemNetworks, 2007
- Resource extension functions: properties, inversion, and generalization to segmentsOR Spectrum, 2007
- Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraintsDiscrete Optimization, 2006
- Accelerated label setting algorithms for the elementary resource constrained shortest path problemOperations Research Letters, 2006
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problemsNetworks, 2004
- Multidimensional divide-and-conquerCommunications of the ACM, 1980