A generic method for identifying and exploiting dominance relations

Authors:
Geoffrey Chu;Peter J. Stuckey
Affiliations:
National ICT Australia, Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Australia;National ICT Australia, Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Australia
Venue:
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Year:
2012

Citing 16
Cited 1

Learning Dominance Relations in Combined Search Problems

IEEE Transactions on Software Engineering
Nurse scheduling using constraint logic programming

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A new heuristic and dominance relations for no-wait flowshops with setups

Computers and Operations Research
Symmetry Breaking

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Cut Framework for Removing Symmetries

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem

INFORMS Journal on Computing
Propagation via lazy clause generation

Constraints
On implementing symmetry detection

Constraints
An efficient model and strategy for the steel mill slab design problem

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Minimizing the maximum number of open stacks by customer search

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Lazy clause generation reengineered

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Effective redundant constraints for online scheduling

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Solving Talent Scheduling with Dynamic Programming

INFORMS Journal on Computing
Static and dynamic structural symmetry breaking

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The challenge of exploiting weak symmetries

CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Automatically exploiting subproblem equivalence in constraint programming

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Using dual presolving reductions to reformulate cumulative constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many constraint problems exhibit dominance relations which can be exploited for dramatic reductions in search space. Dominance relations are a generalization of symmetry and conditional symmetry. However, unlike symmetry breaking which is relatively well studied, dominance breaking techniques are not very well understood and are not commonly applied. In this paper, we present formal definitions of dominance breaking, and a generic method for identifying and exploiting dominance relations via dominance breaking constraints. We also give a generic proof of the correctness and compatibility of symmetry breaking constraints, conditional symmetry breaking constraints and dominance breaking constraints.