Automatically exploiting subproblem equivalence in constraint programming

DOI10.1007/978-3-642-13520-0_10MaRDI QIDQ3569921zbMATH OpenOpenAlexFDO

Authors Geoffrey Chu, Maria Garcia De La Banda, Peter J. Stuckey

Publication date 22 June 2010

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13520-0_10

Mathematics Subject Classification ID

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

Recommendations

• Exploiting subproblem dominance in constraint programming
• Caching Search States in Permutation Problems
• Removing propagation redundant constraints in redundant modeling
• Recent Advances in Constraints
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(10)

• Caching Search States in Permutation Problems
• Exploiting subproblem dominance in constraint programming
• Why CP portfolio solvers are (under)utilized? Issues and challenges
• Automatic generation of dominance breaking nogoods for a class of constraint optimization problems
• A method for detecting symmetries in constraint models and its generalisation
• Exploiting functional constraints in automatic dominance breaking for constraint optimization
• Auto-tabling for subproblem presolving in MiniZinc
• Automatic generation of redundant models for permutation constraint satisfaction problems
• Dominance breaking constraints
• Scheduling double round-robin tournaments with divisional play using constraint programming

Describes a project that uses

Uses Software

• Gecode
• MiniZinc

This page was built for publication: Automatically exploiting subproblem equivalence in constraint programming

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