Principles and Practice of Constraint Programming – CP 2004

DOI10.1007/b100482zbMath1152.68560OpenAlexW1508891358MaRDI QIDQ5900302

Kalev Kask, Rina Dechter, Vibhav Gogate

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 (12)

On the Integration of Singleton Consistencies and Look-Ahead Heuristics ⋮ A SAT Approach to Clique-Width ⋮ Solution Counting Algorithms for Constraint-Centered Search Heuristics ⋮ Solving Graph Problems via Potential Maximal Cliques ⋮ \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions ⋮ Tree decomposition and discrete optimization problems: a survey ⋮ Solution counting algorithms for constraint-centered search heuristics ⋮ An Experimental Study of the Treewidth of Real-World Graph Data ⋮ Positive-Instance Driven Dynamic Programming for Treewidth. ⋮ Computing treewidth on the GPU ⋮ Unnamed Item ⋮ Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth

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