Principles and Practice of Constraint Programming – CP 2004
From MaRDI portal
Publication:5900302
DOI10.1007/b100482zbMath1152.68560MaRDI 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
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Solving Graph Problems via Potential Maximal Cliques, Unnamed Item, Unnamed Item, Unnamed Item, Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth, On the Integration of Singleton Consistencies and Look-Ahead Heuristics, \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions, Solution counting algorithms for constraint-centered search heuristics, Tree decomposition and discrete optimization problems: a survey, A SAT Approach to Clique-Width, Solution Counting Algorithms for Constraint-Centered Search Heuristics