Dynamic programming algorithms for the (Elementary) Resource Constrained Shortest Path Problem

Abstract : The Resource Constrained Shortest Path Problem (RCSPP) often arises as a subproblem when decomposition techniques are applied to solve combinatorial optimization problems, most notably those of routing and scheduling. In this talk, we propose variants of the state-of-the-art dynamic programming algorithms for solving the RCSPP, and we assess their efficiency through computational experiments.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-00857928
Contributor : Ruslan Sadykov <>
Submitted on : Wednesday, September 4, 2013 - 11:43:31 AM
Last modification on : Friday, January 4, 2019 - 5:32:57 PM

Identifiers

  • HAL Id : hal-00857928, version 1

Citation

André Linhares, Ruslan Sadykov, François Vanderbeck, Luigi Di Puglia Pugliese, Francesca Guerriero. Dynamic programming algorithms for the (Elementary) Resource Constrained Shortest Path Problem. 26th European Conference on Operational Research, Jul 2013, Rome, Italy. ⟨hal-00857928⟩

Share

Metrics

Record views

506