TL;DR
This paper surveys recent advances in symmetry breaking constraints, focusing on techniques for row, column, and value symmetry in combinatorial problems to improve solver efficiency.
Contribution
It provides a comprehensive overview of recent methods for symmetry breaking constraints, highlighting new results and practical approaches for common symmetry types.
Findings
Effective constraints for row and column symmetry
Methods for eliminating value symmetry
Enhanced solver performance through symmetry breaking
Abstract
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.