Sciweavers

114 search results - page 1 / 23
» Resource Constrained Shortest Paths
Sort
View
CPAIOR
2005
Springer
13 years 10 months ago
Shorter Path Constraints for the Resource Constrained Shortest Path Problem
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
Thorsten Gellermann, Meinolf Sellmann, Robert Wrig...
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
13 years 8 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
NETWORKS
2008
13 years 4 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
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...
Giovanni Righini, Matteo Salani
CP
2003
Springer
13 years 9 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 6 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi