Caching Search States in Permutation Problems

DOI10.1007/11564751_47MaRDI QIDQ3524209zbMATH OpenOpenAlexFDO

Authors Barbara M. Smith

Publication date 9 September 2008

Published in Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Model Checking Software
• Exploiting subproblem dominance in constraint programming
• Search-Order Independent State Caching
• scientific article; zbMATH DE number 4123296
• Automatically exploiting subproblem equivalence in constraint programming

Cited in

(9)

• A complete solution to the maximum density still life problem
• A method for detecting symmetries in constraint models and its generalisation
• Search-Order Independent State Caching
• An enhanced branch-and-bound algorithm for the talent scheduling problem
• Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
• Automatically exploiting subproblem equivalence in constraint programming
• Exploiting subproblem dominance in constraint programming
• Model Checking Software
• Exploiting functional constraints in automatic dominance breaking for constraint optimization

This page was built for publication: Caching Search States in Permutation Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524209)