DC FieldValueLanguage
dc.contributor.authorRoksandić, Sanjaen
dc.contributor.authorCarrizosa, Emilioen
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:55Z-
dc.date.available2020-05-01T20:13:55Z-
dc.date.issued2013-01-01en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1789-
dc.description.abstractE consider multifacility Huff location problem on networks. This mixed integer nonlinear optimization problem is solved using three metaheuristics: Variable Neighborhood Search, Simulated Annealing and Multi-Start Local Search. Computational experience is reported. We also propose a mathematical model for solving the problem exactly.e consider multifacility Huff location problem on networks. This mixed integer nonlinear optimization problem is solved using three metaheuristics: Variable Neighborhood Search, Simulated Annealing and Multi-Start Local Search. Computational experience is reported. We also propose a mathematical model for solving the problem exactly.en
dc.publisherIEEE-
dc.relation.ispartofProceedings of 2013 International Conference on Industrial Engineering and Systems Management, IEEE - IESM 2013en
dc.titleSolving multifacility Huff location models on networksen
dc.typeConference Paperen
dc.relation.conference2013 International Conference on Industrial Engineering and Systems Management, IEEE - IESM 2013; Rabat; Morocco; 28 October 2013 through 30 October 2013-
dc.identifier.scopus2-s2.0-84899092863en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
item.openairetypeConference Paper-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

1
checked on Apr 16, 2024

Page view(s)

65
checked on Apr 16, 2024

Google ScholarTM

Check


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