Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
By Giovanni Righini, Matteo Salani. Discrete Optimization, 2006
397 citations recorded by the source corpus.
Subfields: Automotive Engineering, Industrial and Manufacturing Engineering, Transportation
View Paper: https://www.semanticscholar.org/paper/da44e75f16442d58eb3e46d00aeb4f6c94fdfb87
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Automotive Engineering
- Michael Schneider
- Stefan Røpke
- Jean-François Cordeau
- Gilbert Laporte
- Jakob Puchinger
- Richard F. Hartl
- Gerhard Hiermann
- Roberto Roberti
In Industrial and Manufacturing Engineering
- Michael Schneider
- Gilbert Laporte
- Jean-François Cordeau
- Stefan Røpke
- Roberto Roberti
- Jakob Puchinger
- Richard F. Hartl
- Gerhard Hiermann
In Transportation
- Roberto Roberti
- Roberto Baldacci
- Aristide Mingozzi
- Stefan Røpke
- Guy Desaulniers
- Jean-François Cordeau
- Stefan Irnich
- Richard F. Hartl
Citations in the corpus
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (2012, methodology): “Righini et al. (2006) proposed a DP method, called decremental state-space algorithm.”
- The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations (2016, positive): “A resource bound was used as suggested by Righini and Salani (2006).”
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (2014, methodology): “Alternatively, a bi-directional search [see Righini and Salani, 2006] can be applied and often yields lower computational times.”
- Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows (2009, background): “On a different note, Righini and Salani (2006) have proposed a bi-directional approach to shortest path problems with resource constraints.”