Combining Symmetry Breaking and Global Constraints
نویسندگان
چکیده
We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a general purpose propagator for this family of constraints, and show how to improve its complexity by exploiting properties of the included global constraints.
منابع مشابه
Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums
We introduce a new global constraint which combines together the lexicographic ordering constraint with some sum constraints. Lexicographic ordering constraints are frequently used to break symmetry, whilst sum constraints occur in many problems involving capacity or partitioning. Our results show that this global constraint is useful when there is a very large space to explore, such as when th...
متن کاملSymmetry Breaking and Local Search Spaces
The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust solvers and models. A recently observed phenomenon is the negative effect of symmetry breaking constraints on local search performance. The reasons for this are poorly understood, and we attempt to shed light on the ph...
متن کاملThe Complexity of Global Constraints
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the same tools of computational complexity can be used in the design and analysis of specific global constraints. In particular, we illustrate how computational complexity can be used to determine when a lesser level of local...
متن کاملA note on the compatibility of static symmetry breaking constraints and dynamic symmetry breaking methods
Adding static constraints (e.g. lexicographic constraints) and modifying a backtracking search procedure to dynamically eliminate the consideration of symmetrically equivalent states (e.g. SBDS and SBDD) are two common methods for breaking symmetry, with different advantages and disadvantages. It is natural to try to combine these in order to try to harness the strengths of each. However, in so...
متن کاملOn the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry
We consider a common type of symmetry where we have a matrix of decision variables with interchangeable rows and columns. A simple and efficient method to deal with such row and column symmetry is to post symmetry breaking constraints like DOUBLELEX and SNAKELEX. We provide a number of positive and negative results on posting such symmetry breaking constraints. On the positive side, we prove th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008