DC FieldValueLanguage
dc.contributor.authorBrimberg, Jacken
dc.contributor.authorHansen, Pierreen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:13Z-
dc.date.available2020-05-02T16:42:13Z-
dc.date.issued2006-01-01en
dc.identifier.issn1471-678Xen
dc.description.abstractThe continuous location-allocation problem requires finding sites for m new facilities in the plane in order to serve n users such that the total transportation costs are minimized. Several heuristics have been developed to solve this well-studied global optimization problem. However, little work has been done using decomposition techniques. In this paper, we examine a few new ways to decompose the location-allocation problem. These strategies are then embedded in a variable neighbourhood decomposition search heuristic and tested on large instances of this problem.en
dc.publisherOxford University Press-
dc.relation.ispartofIMA Journal of Management Mathematicsen
dc.subjectDecomposition | Heuristics | Location-allocation | Variable neighbourhood searchen
dc.titleDecomposition strategies for large-scale continuous location-allocation problemsen
dc.typeArticleen
dc.identifier.doi10.1093/imaman/dpl002en
dc.identifier.scopus2-s2.0-33750083891en
dc.relation.firstpage307en
dc.relation.lastpage316en
dc.relation.issue4en
dc.relation.volume17en
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

23
checked on Nov 27, 2022

Page view(s)

32
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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