Sciweavers

Share
ENDM
2010

Formulation symmetries in circle packing

8 years 7 months ago
Formulation symmetries in circle packing
The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of formulation symmetries in MINLP instances. A software implementation of this method is used to conjecture the group structure of the problem symmetries of packing equal circles in a square. We provide a proof of the conjecture and compare the performance of spatial Branch-and-Bound on the original problem with the performance on a reformulation that cuts away symmetric optima.
Alberto Costa, Leo Liberti, Pierre Hansen
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2010
Where ENDM
Authors Alberto Costa, Leo Liberti, Pierre Hansen
Comments (0)
books