AICCApr 16, 2012

Symmetry Breaking Constraints: Recent Results

arXiv:1204.3348v141 citations
Originality Synthesis-oriented
AI Analysis

This is an incremental survey paper summarizing existing methods for a domain-specific problem in combinatorial optimization.

The paper surveys recent results on symmetry breaking constraints for combinatorial problems, focusing on row and column symmetry and value symmetry elimination.

Symmetry is an important problem in many combinatorial problems. One way of dealing with symmetry is to add constraints that eliminate symmetric solutions. We survey recent results in this area, focusing especially on two common and useful cases: symmetry breaking constraints for row and column symmetry, and symmetry breaking constraints for eliminating value symmetry

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes