Dynamic programming algorithms for the (Elementary) Resource Constrained Shortest Path Problem
Langue
en
Communication dans un congrès
Ce document a été publié dans
26th European Conference on Operational Research, 2013-07-01, Rome. 2013
Résumé en anglais
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 ...Lire la suite >
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.< Réduire
Origine
Importé de halUnités de recherche