Variable neighbourhood search for the k-labelled spanning forest problem

In this paper we present an efficient Variable Neighbourhood Search for the k-labelled spanning forest (kLSF) problem, an NP-hard graph problem related to the minimum labelling spanning tree problem, and with strong implications in multimodal transportation networks. Given an undirected input graph...

Full description

Saved in:

Bibliographic Details
Published in:	Electronic notes in discrete mathematics Vol. 47; pp. 29 - 36
Main Authors:	Consoli, Sergio, Pérez, José Andrés Moreno
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01-02-2015
Subjects:	Combinatorial optimization Graph theory Variable Neighbourhood Search Combinatorial optimization Variable Neighbourhood Search Graph theory
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	In this paper we present an efficient Variable Neighbourhood Search for the k-labelled spanning forest (kLSF) problem, an NP-hard graph problem related to the minimum labelling spanning tree problem, and with strong implications in multimodal transportation networks. Given an undirected input graph whose edges are labelled, and an integer positive value k¯, the aim is to find a spanning forest of the input graph having the minimum number of connected components and the upper bound k¯ on the number of labels to use.
ISSN:	1571-0653 1571-0653
DOI:	10.1016/j.endm.2014.11.005