DC FieldValueLanguage
dc.contributor.authorConsoli, Sergioen
dc.contributor.authorMoreno Pérez, José Andrésen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:41:56Z-
dc.date.available2020-05-02T16:41:56Z-
dc.date.issued2017-05-01en
dc.identifier.issn0969-6016en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2403-
dc.description.abstractIn this paper, we study the k-labeled spanning forest (kLSF) problem in which an undirected graph whose edges are labeled and an integer-positive value k are given; the aim is to find a spanning forest of the input graph with the minimum number of connected components and the upper bound (Formula presented.) on the number of labels. The problem is related to the minimum labeling spanning tree problem and has several applications in the real world. In this paper, we compare several metaheuristics to solve this NP-hard problem. In particular, the proposed intelligent variable neighborhood search (VNS) shows excellent performance, obtaining high-quality solutions in short computational running time. This approach integrates VNS with other complementary approaches from machine learning, statistics, and experimental algorithmics, in order to produce high-quality performance and completely automate the resulting optimization strategy.en
dc.publisherWiley-
dc.relation.ispartofInternational Transactions in Operational Researchen
dc.subjectcombinatorial optimization | graphs and networks | intelligent optimization | k-labeled spanning forest | minimum labeling spanning trees | variable neighborhood searchen
dc.titleComparison of metaheuristics for the k-labeled spanning forest problemen
dc.typeArticleen
dc.identifier.doi10.1111/itor.12217en
dc.identifier.scopus2-s2.0-84947785869en
dc.relation.firstpage559en
dc.relation.lastpage582en
dc.relation.issue3en
dc.relation.volume24en
dc.description.rankM21-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

4
checked on Jun 14, 2024

Page view(s)

53
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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