The system will be going down for regular maintenance. Please save your work and logout.
Dynamic programming algorithms for the (Elementary) Resource Constrained Shortest Path Problem
Language
en
Communication dans un congrès
This item was published in
26th European Conference on Operational Research, 2013-07-01, Rome. 2013
English 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 ...Read more >
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.Read less <
Origin
Hal imported