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.
Type de document :
Communication dans un congrès
26th European Conference on Operational Research, Jul 2013, Rome, Italy. 2013
Liste complète des métadonnées

https://hal.inria.fr/hal-00857928
Contributeur : Ruslan Sadykov <>
Soumis le : mercredi 4 septembre 2013 - 11:43:31
Dernière modification le : vendredi 4 janvier 2019 - 17:32:57

Identifiants

  • 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. 2013. 〈hal-00857928〉

Partager

Métriques

Consultations de la notice

486