Exploiting subproblem dominance in constraint programming

DOI10.1007/S10601-011-9112-9MaRDI QIDQ453591zbMATH OpenOpenAlexFDO

Authors 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

searchdominancecaching

Mathematics Subject Classification ID

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

Recommendations

• Automatically exploiting subproblem equivalence in constraint programming
• Dominance breaking constraints
• Caching Search States in Permutation Problems
• Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
• Exploiting symmetries within constraint satisfaction search

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 2084699 (Why is no real title available?)
• Bin completion algorithms for multicontainer packing, Knapsack, and covering problems
• Caching Search States in Permutation Problems
• Conditional Symmetry Breaking
• Dynamic programming to minimize the maximum number of open stacks
• Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches
• Propagation via lazy clause generation

Cited in

(10)

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Caching Search States in Permutation Problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Solving subgraph isomorphism problems with constraint programming
• Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
• Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
• Automated streamliner portfolios for constraint satisfaction problems
• Exploiting functional constraints in automatic dominance breaking for constraint optimization
• Automatically exploiting subproblem equivalence in constraint programming
• Compiling CP subproblems to MDDs and d-DNNFs

Describes a project that uses

Uses Software

• Gecode
• MiniZinc
• CHIP

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

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