• Corpus ID: 14452122

Comparison of Symmetry Breaking Methods in Constraint Programming

@inproceedings{Petrie2005ComparisonOS,
  title={Comparison of Symmetry Breaking Methods in Constraint Programming},
  author={Karen E. Petrie and Barbara M. Smith},
  year={2005}
}
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the search algorithm so that search never visits assignments symmetric to those already considered. One such approach is SBDS (Symmetry Breaking During Search); a modification is GAP-SBDS, which works with the symmetry group rather than individual symmetries. There has been little experience of how these techniques compare… 

Figures and Tables from this paper

An Efficient Way of Breaking Value Symmetries

TLDR
It is the first time to the authors' knowledge that it is possible to break all combinations of value and variable symmetries by adding constraints, and a new global constraint is presented that deals with the case where there are too many value symmetry.

A comparison of SBDS and Dynamic Lex Constraints

Many symmetry breaking methods have been proposed so far. Previous works have shown that these methods could be combined together under some conditions. We use a different angle : we compare the

A Symmetry-Breaking Node Equivalence for Pruning the Search Space in Backtracking Algorithms

TLDR
A new equivalence on graphs is introduced, defined by its symmetry-breaking capability, in which the equivalence is used to prune the search tree and an optimization problem with the goal of finding an equivalence partition with the highest pruning potential is defined.

Symmetry in Integer Linear Programming

  • F. Margot
  • Mathematics
    50 Years of Integer Programming
  • 2010
TLDR
This paper reviews techniques developed to take advantage of the symmetry in an ILP during its solution, and surveys related topics, such as symmetry detection, polyhedral studies of symmetric ILPs, and enumeration of all non isomorphic optimal solutions.

School of Business 11-2009 Symmetry in Integer Linear Programming

An integer linear program (ILP) is symmetric if its variables can be permuted without changing the structure of the problem. Areas where symmetric ILPs arise range from applied settings (scheduling

Progressive Solutions: A Simple but Efficient Dominance Rule for Practical RCPSP

TLDR
The straightforward but generic notion of progressive solution is defined, in which the order of corresponding tasks of similar projects is deduced a priori, and it is proved that the search space can be reduced to progressive solutions.

References

SHOWING 1-10 OF 12 REFERENCES

Symmetry-Breaking Predicates for Search Problems

TLDR
This work presents a general scheme whereby symmetries are exploited by adding \symmetry-breaking" predicates to the theory, and discusses methods for generating partial symmetry-breaking predicates, and shows that in several speciic cases asymmetries can be broken either fully or partially using a polynomial number of predicates.

Breaking symmetries in all different problems

TLDR
It is shown how this partial ordering of the variables can be automatically computed using computational group theory (CGT) and that partial orders can be safely used together with the GE-tree method of [Roney-Dougal et al., 2004].

Symmetry Breaking in the Alien Tiles Puzzle

TLDR
This is the first integration of an algebraic system like GAP and a constraint programming system like ILOG Solver, based on the Alien Tiles game, and a 40-fold run-time provement over code with no symmetry breaking is obtained.

Breaking Row and Column Symmetries in Matrix Models

TLDR
This work identifies an important class of symmetries in constraint programming, arising from matrices of decision variables where rows and columns can be swapped, and identifies special cases where all compositions of the row and column asymmetries can be eliminated by the addition of only a linear number of symmetry-breaking constraints.

Graceful Labelings of Nearly Complete Graphs

It is well known that the complete graph Kn is graceful only if n ≤ 4. We prove that Kn — e is graceful only if n ≤ 5 and that any Kn—2e and any Kn — 3e is graceful only if n ≤ 6. Moreover we

Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming

TLDR
This short tutorial on constraint programming explains how it relates to familiar mathematical programming concepts and how constraint programming and mathematical programming technologies are complementary.

Scheduling a Major College Basketball Conference - Revisited

  • M. Henz
  • Computer Science
    Oper. Res.
  • 2001
TLDR
A solution of round-robin tournament planning based on finite-domain constraint programming yields a dramatic performance improvement, which makes an integrated interactive software solution feasible.

Constraint Programming and Its Relationship to Mathematical Programming

TLDR
This short tutorial on constraint programming explains how it relates to familiar mathematical programming concepts and how constraint programming and mathematical programming technologies are complementary.

Scheduling a Major College Basketball Conference

I am pleased to present this Focus Issue on Manufacturing Logistics. Unlike a special issue, where new papers are solicited that deal with a theme, this issue was created by pulling together

Technical Report APES-22-2000

  • APES Research Group, October
  • 2000