Cost-based Filtering for Shorter Path Constraints

@article{Sellmann2006CostbasedFF,
  title={Cost-based Filtering for Shorter Path Constraints},
  author={Meinolf Sellmann and Thorsten Gellermann and Robert Wright},
  journal={Constraints},
  year={2006},
  volume={12},
  pages={207-238}
}
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 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, these techniques have… CONTINUE READING
Highly Cited
This paper has 56 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

57 Citations

051015'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 47 references

Resource Constrained Shortest Paths

View 5 Excerpts
Highly Influenced

The Shortest Route Problem with Constraints

H. Joksch
Journal of Mathematical Analysis and Application, 14:191-197, • 1966
View 4 Excerpts
Highly Influenced

The Rough Guide to Constraint Propagation

CP • 1999
View 15 Excerpts
Highly Influenced

Algorithms for Constraint-Satisfaction Problems: A Survey

AI Magazine • 1992
View 15 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…