Exploiting subproblem dominance in constraint programming

DOI10.1007/s10601-011-9112-9zbMath1247.68249OpenAlexW2095067556MaRDI QIDQ453591

Geoffrey Chu, Maria Garcia de la Banda, Peter J. Stuckey

Publication date: 27 September 2012

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-011-9112-9

zbMATH Keywords

dominancesearchcaching

Mathematics Subject Classification ID

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

Related Items (3)

Automatic generation of dominance breaking nogoods for a class of constraint optimization problems ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ Compiling CP subproblems to MDDs and d-DNNFs

Uses Software

• CHIP
• MiniZinc
• Gecode

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propagation via lazy clause generation
• Dynamic Programming to Minimize the Maximum Number of Open Stacks
• Conditional Symmetry Breaking
• Caching Search States in Permutation Problems
• Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches

This page was built for publication: Exploiting subproblem dominance in constraint programming