Sciweavers

22 search results - page 2 / 5
» Symmetry Breaking and Local Search Spaces
Sort
View
CP
2006
Springer
13 years 8 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann
AMAI
2004
Springer
13 years 10 months ago
Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...
Brahim Hnich, Zeynep Kiziltan, Toby Walsh
CSCLP
2006
Springer
13 years 8 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
CSCLP
2004
Springer
13 years 8 months ago
Constraint-Based Approaches to the Covering Test Problem
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
CPAIOR
2005
Springer
13 years 10 months ago
Scheduling Social Golfers Locally
The scheduling of social golfers has attracted significant attention in recent years because of its highly symmetrical and combinatorial nature. In particular, it has become one o...
Iván Dotú, Pascal Van Hentenryck