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 by Metaheuristic Search S. D. Prestwich1
 

Summary: Symmetry Breaking by Metaheuristic Search
S. D. Prestwich1
, B. Hnich2
, R. Rossi1
, and S. A. Tarim3
1
Cork Constraint Computation Centre, Ireland
2
Faculty of Computer Science, Izmir University of Economics, Turkey
3
Department of Management, Hacettepe University, Turkey
s.prestwich@cs.ucc.ie, brahim.hnich@ieu.edu.tr,
r.rossi@4c.ucc.ie, armagan.tarim@hacettepe.edu.tr
Abstract
Several methods exist for breaking symmetry in
constraint problems, but most potentially suffer
from high memory requirements, high computa-
tional overhead, or both. We describe a new par-
tial symmetry breaking method that can be applied
to arbitrary variable/value symmetries. It models

  

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

 

Collections: Engineering