373 search results - page 1 / 75 » Automatic Generation of Symmetry-Breaking Constraints |
179
Voted
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
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...
157
Voted
CP
2005
Springer
15 years 12 months ago
2005
Springer
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...
189
Voted
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
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...
147
Voted
COMPSAC
2006
IEEE
16 years 13 days ago
2006
IEEE
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...
259
Voted
CP
2009
Springer
16 years 7 months ago
2009
Springer
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 ...