96 search results - page 3 / 20 » Fast Exact MultiConstraint Shortest Path Algorithms |
SODA
1996
ACM
13 years 8 months ago
1996
ACM
JAL
2007
13 years 7 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
IFIP
2007
Springer
14 years 1 months ago
2007
Springer
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
NETWORKS
2008
13 years 7 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...