Principles and Practice of Constraint Programming – CP 2003

DOI10.1007/b13743zbMath1273.90231OpenAlexW2497660909MaRDI QIDQ5897223

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)

Related Items (8)

Undirected forest constraints ⋮ Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ A \texttt{cost-regular} based hybrid column generation approach ⋮ The complexity of reasoning with global constraints ⋮ Lazy Constraint Imposing for Improving the Path Constraint ⋮ A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation ⋮ On global warming: Flow-based soft global constraints ⋮ Complete bound consistency for the global cardinality constraint

This page was built for publication: Principles and Practice of Constraint Programming – CP 2003