Sciweavers

257 search results - page 6 / 52
» Breaking Value Symmetry
Sort
View
COCOA
2008
Springer
13 years 8 months ago
Automatic Generation of Symmetry-Breaking Constraints
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...
Leo Liberti
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 6 months ago
Parameterized Complexity Results in Symmetry Breaking
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...
Toby Walsh
CP
2007
Springer
14 years 1 months ago
Constraint Symmetry for the Soft CSP
We introduce a definition of constraint symmetry for soft CSPs, based on the definition of constraint symmetry for classical CSPs. We show that the constraint symmetry group of a...
Barbara M. Smith, Stefano Bistarelli, Barry O'Sull...
CSCLP
2004
Springer
13 years 11 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...
AAAI
2008
13 years 10 months ago
The Parameterized Complexity of Global Constraints
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...