Principles and Practice of Constraint Programming – CP 2004

DOI10.1007/b100482zbMath1152.68583OpenAlexW1508891358MaRDI QIDQ5900322

Peter J. Stuckey, Christian Schulte

Publication date: 9 September 2008

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

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints ⋮ Generalised arc consistency for the AllDifferent constraint: an empirical survey ⋮ Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint ⋮ Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ Boosting the feasibility pump ⋮ Feasibility pump 2.0 ⋮ View-based propagation of decomposable constraints

Uses Software

• Choco

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