Dynamic programming algorithms for the (Elementary) Resource Constrained Shortest Path Problem
Idioma
en
Communication dans un congrès
Este ítem está publicado en
26th European Conference on Operational Research, 2013-07-01, Rome. 2013
Resumen en inglés
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 ...Leer más >
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.< Leer menos
Orígen
Importado de HalCentros de investigación