DC FieldValueLanguage
dc.contributor.authorBrimberg, Jacken
dc.contributor.authorJanićijević, Stefanaen
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:52Z-
dc.date.available2020-05-01T20:13:52Z-
dc.date.issued2017-08-01en
dc.identifier.issn1862-4472en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1766-
dc.description.abstractIn this paper we show that the clique partitioning problem can be reformulated in an equivalent form as the maximally diverse grouping problem (MDGP). We then modify a skewed general variable neighborhood search (SGVNS) heuristic that was first developed to solve the MDGP. Similarly as with the MDGP, significant improvements over the state of the art are obtained when SGVNS is tested on large scale instances. This further confirms the usefulness of a combined approach of diversification afforded with skewed VNS and intensification afforded with the local search in general VNS.en
dc.relationNatural Sciences and Engineering Research Council of Canada Discovery Grant (NSERC #205041-2008)-
dc.relationMathematical Modelas and Optimization Methods on Large-Scale Systems-
dc.relationRSF (Russian Federation) grant 14-41-00039-
dc.relation.ispartofOptimization Lettersen
dc.subjectClique partitioning | Maximum diverse grouping problem | Variable neighborhood searchen
dc.titleSolving the clique partitioning problem as a maximally diverse grouping problemen
dc.typeArticleen
dc.identifier.doi10.1007/s11590-015-0869-4en
dc.identifier.scopus2-s2.0-84923885000en
dc.relation.firstpage1123en
dc.relation.lastpage1135en
dc.relation.issue6en
dc.relation.volume11en
dc.description.rankM21-
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-0003-3607-6704-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php-
crisitem.project.fundingProgramDirectorate for Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103-
Show simple item record

SCOPUSTM   
Citations

22
checked on Jun 15, 2024

Page view(s)

90
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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