New dynamic programming algorithms for the resource constrained elementary shortest path problem

By Giovanni Righini, Matteo Salani. Networks, 2008

370 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering, Transportation

View Paper: https://www.semanticscholar.org/paper/5888ffb7c66dbea54e20df4a67146d2bb41e4c23

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Stefan Røpke
2. Roberto Baldacci
3. Jean-François Cordeau
4. Aristide Mingozzi
5. Pieter Vansteenwegen
6. Dirk Van Oudheusden
7. Wouter Souffriau
8. Roberto Roberti

In Industrial and Manufacturing Engineering

1. Jean-François Cordeau
2. Gilbert Laporte
3. Stefan Røpke
4. Roberto Roberti
5. Roberto Baldacci
6. Aristide Mingozzi
7. Pieter Vansteenwegen
8. Dirk Van Oudheusden

In Transportation

1. Roberto Roberti
2. Roberto Baldacci
3. Aristide Mingozzi
4. Stefan Røpke
5. Jean-François Cordeau
6. Pieter Vansteenwegen
7. Dirk Van Oudheusden
8. Wouter Souffriau

Citations in the corpus

• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem (2011, methodology): “Similar methods have been used by Righini and Salani (2008), Jepsen et al. (2008), and Desaulniers et al. (2008).”
• The orienteering problem: A survey (2011, methodology): “Decremental state space relaxation (Righini and Salani, 2008) is used to reduce the number of states to be explored.”
• Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows (2009, methodology): “…approach for improving label setting algorithms used for solving resource constrained elementary shortest path problems was proposed by Boland et al. (2006) and by Righini and Salani (2008) and used in the most successful exact algorithm for the VRPTW to date (Desaulniers et al. (2008)).”