Sciweavers

373 search results - page 1 / 75
» Automatic Generation of Symmetry-Breaking Constraints
Sort
View
COCOA
2008
Springer
13 years 5 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
CP
2005
Springer
13 years 10 months ago
Automatic Detection of Variable and Value Symmetries
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
Jean-Francois Puget
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
13 years 8 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
COMPSAC
2006
IEEE
13 years 10 months ago
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
Jun Yan, Jian Zhang
CP
2009
Springer
14 years 5 months ago
Generating Optimal Stowage Plans for Container Vessel Bays
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...
Alberto Delgado, Christian Schulte, Rune Mø...