DC FieldValueLanguage
dc.contributor.authorDrezner, Zvien
dc.contributor.authorBrimberg, Jacken
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorSalhi, Saiden
dc.date.accessioned2020-05-02T16:42:01Z-
dc.date.available2020-05-02T16:42:01Z-
dc.date.issued2015-11-01en
dc.identifier.issn0925-5001en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2441-
dc.description.abstractTwo new approaches for the solution of the (Formula presented.)-median problem in the plane are proposed. One is a Variable Neighborhood Search and the other one is a concentric search. Both approaches are enhanced by a front-end procedure for finding good starting solutions and a decomposition heuristic acting as a post optimization procedure. Computational results confirm the effectiveness of the proposed algorithms.en
dc.publisherSpringer Link-
dc.relation.ispartofJournal of Global Optimizationen
dc.subjectConcentric search | Concentric tabu | Location-allocation | Planar p-median | Variable Neighborhood Searchen
dc.titleSolving the planar p-median problem by variable neighborhood and concentric searchesen
dc.typeArticleen
dc.identifier.doi10.1007/s10898-014-0183-1en
dc.identifier.scopus2-s2.0-84943354168en
dc.relation.firstpage501en
dc.relation.lastpage514en
dc.relation.issue3en
dc.relation.volume63en
dc.description.rankM21-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

11
checked on Apr 2, 2025

Page view(s)

17
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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