Dynamic programming algorithms for the (Elementary) Resource Constrained Shortest Path Problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-00857928 , version 1 (04-09-2013)

Identifiants

  • HAL Id : hal-00857928 , version 1

Citer

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⟩
299 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More