Automatically Exploiting Subproblem Equivalence in Constraint Programming

DOI10.1007/978-3-642-13520-0_10zbMath1285.68153OpenAlexW1501900553MaRDI QIDQ3569921

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

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

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

Related Items (5)

Automatic generation of dominance breaking nogoods for a class of constraint optimization problems ⋮ Scheduling double round-robin tournaments with divisional play using constraint programming ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges ⋮ Dominance breaking constraints ⋮ A method for detecting symmetries in constraint models and its generalisation

Uses Software

• MiniZinc
• Gecode

This page was built for publication: Automatically Exploiting Subproblem Equivalence in Constraint Programming