DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorPlastria, Franken
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:57Z-
dc.date.available2020-05-01T20:13:57Z-
dc.date.issued2007-12-01en
dc.identifier.isbn978-3-540-74445-0en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1803-
dc.description.abstractCircle 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.en
dc.publisherSpringer Link-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.titleFormulation space search for circle packing problemsen
dc.typeArticleen
dc.relation.conferenceInternational Workshop on Stochastic Local Search, SLS 2007; Brussels; Belgium; 6 September 2007 through 8 September 2007-
dc.identifier.doi10.1007/978-3-540-74446-7_20-
dc.identifier.scopus2-s2.0-38049138777en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage212en
dc.relation.lastpage216en
dc.relation.volume4638 LNCSen
dc.description.rankM23-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

24
checked on Apr 2, 2025

Page view(s)

26
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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