Sciweavers

91 search results - page 3 / 19
» Symmetry Breaking Ordering Constraints
Sort
View
CP
2006
Springer
13 years 10 months ago
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 :...
Jean-François Puget
AAAI
2006
13 years 8 months ago
An Efficient Way of Breaking Value Symmetries
Several methods for breaking value symmetries have been proposed recently in the constraint programming community. They can be used in conjunction with variable symmetry breaking ...
Jean-François Puget
CSCLP
2006
Springer
13 years 10 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
CPAIOR
2009
Springer
14 years 1 months ago
Six Ways of Integrating Symmetries within Non-overlapping Constraints
Abstract: This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-recta...
Magnus Ågren, Nicolas Beldiceanu, Mats Carls...
IJCAI
2003
13 years 8 months ago
Multiset Ordering Constraints
We identify a new and important global (or nonbinary) constraint which ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This const...
Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahi...