Many real world problems, e.g. in personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest Path Problems with additional constraints. A well studied problem in this class is the Resource Constrained Shortest Path Problem. Reduction techniques are vital ingredients of solvers for the CSPP, that is frequently NP-hard, depending on the nature of the additional constraints. Viewed as heuristics, until today these techniques have not been studied theoretically with respect to their efficiency, i.e., with respect to the relation of filtering power and running time. Using the concepts of Constraint Programming, we provide a theoretical study of cost-based filtering for shorter path constraints on acyclic, on undirected and on directed graphs that do not contain negative cycles. Keywords: constrained shortest paths, problem reduction, optimization constraints, relaxed consistency © Springer-Verlag 2003.
CITATION STYLE
Sellmann, M. (2003). Cost-based filtering for shorter path constraints. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2833, 694–708. https://doi.org/10.1007/978-3-540-45193-8_47
Mendeley helps you to discover research relevant for your work.