Authors: Mladenović, Nenad 
Plastria, Frank
Urošević, Dragan 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Formulation space search for circle packing problems
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 4638 LNCS
First page: 212
Last page: 216
Conference: International Workshop on Stochastic Local Search, SLS 2007; Brussels; Belgium; 6 September 2007 through 8 September 2007
Issue Date: 1-Dec-2007
Rank: M23
ISBN: 978-3-540-74445-0
ISSN: 0302-9743
DOI: 10.1007/978-3-540-74446-7_20
Abstract: 
Circle packing problems were recently solved via reformulation descent (RD) by switching between a cartesian and a polar formulation. Mixed formulations, with circle parameters individually formulated in either coordinate system, lead to local search methods in a formulation space. Computational results with up to 100 circles are included.
Publisher: Springer Link

Show full item record

SCOPUSTM   
Citations

22
checked on Sep 17, 2022

Page view(s)

34
checked on Sep 15, 2022

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.