Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Symmetry Breaking and Branching Constraints C. Mears, M. Garcia de la Banda, M. Wallace, B. Demoen
 

Summary: Symmetry Breaking and Branching Constraints
C. Mears, M. Garcia de la Banda, M. Wallace, B. Demoen
Abstract
Symmetry breaking is the process of eliminat-
ing redundant search by taking advantage of
the symmetries in a problem. Symmetry break-
ing techniques can be combined with other
search heuristics, such as branching constraints
and variable orderings. The interaction be-
tween dynamic symmetry breaking and domain
splitting is discussed, and preliminary results
are presented showing the impact of variable or-
dering on dynamic and static symmetry break-
ing.
1 Introduction
Taking advantage of symmetries when solving problems
with constraint programming has the potential to sig-
nificantly increase efficiency. Much work has been done
in the areas of automatic symmetry detection and sym-
metry breaking (i.e., methods of exploiting the known

  

Source: Aloul, Fadi - Department of Computer Engineering, American University of Sharjah

 

Collections: Engineering