Principles and Practice of Constraint Programming – CP 2003

DOI10.1007/b13743zbMath1273.68334OpenAlexW2497660909MaRDI QIDQ5897227

Pascal Van Hentenryck, Christian Bessiere

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

Mathematics Subject Classification ID

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

Related Items (14)

Modeling uncertainties with chance constraints ⋮ Tractability-preserving transformations of global cost functions ⋮ Undirected forest constraints ⋮ Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ The TV-break packing problem ⋮ Global domain views for expressive and cross-domain constraint programming ⋮ Global constraint catalogue: past, present and future ⋮ Solving subgraph isomorphism problems with constraint programming ⋮ How efficient is a global constraint in practice? A fair experimental framework ⋮ Bounds of graph parameters for global constraints ⋮ The complexity of reasoning with global constraints ⋮ A parametric filtering algorithm for the graph isomorphism problem ⋮ Generic Constraint-based Block Modeling using Constraint Programming ⋮ Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction

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