DC FieldValueLanguage
dc.contributor.authorAmirgaliyeva, Zhaziraen
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorTodosijević, Racaen
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:53Z-
dc.date.available2020-05-01T20:13:53Z-
dc.date.issued2017-07-16en
dc.identifier.issn0377-2217en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1767-
dc.description.abstractThe maximum min-sum dispersion problem aims to maximize the minimum accumulative dispersion among the chosen elements. It is known to be strongly NP-hard problem. In this paper we present heuristic where the objective functions of two different problems are shifted within variable neighborhood search framework. Though this heuristic can be seen as an extended variant of variable formulation search approach that takes into account alternative formulations of one problem, the important difference is that it allows using alternative formulations of more than one optimization problem. Here we use one alternative formulation that is of max-sum type of the originally max–min type maximum diversity problem. Computational experiments on the benchmark instances used in the literature show that the suggested approach improves the best known results for most instances in a shorter computing time.en
dc.publisherElsevier-
dc.relation.ispartofEuropean Journal of Operational Researchen
dc.subjectBinary quadratic programing | Dispersion problems | Metaheuristics | Variable formulation search | Variable neighborhood searchen
dc.titleSolving the maximum min-sum dispersion by alternating formulations of two different problemsen
dc.typeArticleen
dc.identifier.doi10.1016/j.ejor.2016.12.039en
dc.identifier.scopus2-s2.0-85008474577en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage444en
dc.relation.lastpage459en
dc.relation.issue2en
dc.relation.volume260en
dc.description.rankM21a-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0002-9321-3464-
crisitem.author.orcid0000-0003-3607-6704-
Show simple item record

SCOPUSTM   
Citations

24
checked on Jun 20, 2024

Page view(s)

85
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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