Cost-based filtering for shorter path constraints

DOI10.1007/B13743MaRDI QIDQ5897223zbMATH OpenOpenAlexFDO

Authors Meinolf Sellmann

Publication date 2 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13743

zbMATH Keywords

constrained shortest pathsoptimization constraintsproblem reductionrelaxed consistency

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Cost-based filtering for shorter path constraints
• Shorter Path Constraints for the Resource Constrained Shortest Path Problem
• scientific article; zbMATH DE number 1670670
• On an exact method for the constrained shortest path problem
• Solving resource constrained shortest path problems with LP-based methods

Cited in

(10)

• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
• Cost-based filtering for shorter path constraints
• The complexity of reasoning with global constraints
• On global warming: Flow-based soft global constraints
• Lazy constraint imposing for improving the path constraint
• Combining Two Structured Domains for Modeling Various Graph Matching Problems
• Shorter Path Constraints for the Resource Constrained Shortest Path Problem
• Complete bound consistency for the global cardinality constraint
• Undirected forest constraints
• A \texttt{cost-regular} based hybrid column generation approach

This page was built for publication: Cost-based filtering for shorter path constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897223)