DC FieldValueLanguage
dc.contributor.authorConsoli, Sergioen
dc.contributor.authorMoreno Pérez, José Andrésen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:04Z-
dc.date.available2020-05-02T16:42:04Z-
dc.date.issued2013-07-09en
dc.identifier.issn1571-0653-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2469-
dc.description.abstractGiven a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest number of distinct labels (or colours). In recent work, the MLST problem has been shown to be NP-hard and some effective heuristics have been proposed and analyzed. In a currently ongoing project, we investigate an intelligent optimization algorithm to solve the problem. It is obtained by the basic Variable Neighbourhood Search heuristic with the integration of other complements from machine learning, statistics and experimental algorithmics, in order to produce high-quality performance and to completely automate the resulting optimization strategy. Computational experiments show that the proposed metaheuristic has high-quality performance for the MLST problem and it is able to obtain optimal or near-optimal solutions in short computational running time.en
dc.publisherElsevier-
dc.relationSpanish Ministry of Economy and Competitiveness (project TIN2012-32608)-
dc.relation.ispartofElectronic Notes in Discrete Mathematicsen
dc.subjectCombinatorial optimization | Graphs and networks | Intelligent optimization | Minimum labelling spanning trees | Variable neighbourhood searchen
dc.titleIntelligent variable neighbourhood search for the minimum labelling spanning tree problemen
dc.typeArticleen
dc.identifier.doi10.1016/j.endm.2013.05.118en
dc.identifier.scopus2-s2.0-84879735620en
dc.relation.firstpage399en
dc.relation.lastpage406en
dc.relation.volume41en
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

4
checked on Jul 21, 2024

Page view(s)

52
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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