DC FieldValueLanguage
dc.contributor.authorConsoli, Sergioen
dc.contributor.authorMoreno Pérez, José Andrésen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:03Z-
dc.date.available2020-05-02T16:42:03Z-
dc.date.issued2013-12-30en
dc.identifier.isbn978-3-642-44972-7en
dc.identifier.issn0302-9743en
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 analysed. In this paper we present preliminary results of a currently on-going project regarding the implementation of an intelligent optimization algorithm to solve the MLST problem. This algorithm 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.en
dc.publisherSpringer Link-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.subjectCombinatorial optimization | Graphs and networks | Hybrid local search | Intelligent optimization | Minimum labelling spanning treesen
dc.titleIntelligent optimization for the minimum labelling spanning tree problemen
dc.typeConference Paperen
dc.relation.conference7th International Conference on Learning and Intelligent Optimization, LION 7; Catania; Italy; 7 January 2013 through 11 January 2013-
dc.identifier.doi10.1007/978-3-642-44973-4_2en
dc.identifier.scopus2-s2.0-84890956255en
dc.relation.firstpage19en
dc.relation.lastpage23en
dc.relation.volume7997 LNCSen
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeConference Paper-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

Page view(s)

6
checked on Dec 2, 2021

Google ScholarTM

Check

Altmetric

Altmetric


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