3 citations · 3 across the 5 of their papers we have counts for
5 papers
Minimum Labelling bi-Connectivity
Jose' Andres Moreno Perez, Sergio Consoli
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree pr…
An intelligent extension of Variable Neighbourhood Search for labelling graph problems
Sergio Consoli, Josè Andrès Moreno Pèrez
In this paper we describe an extension of the Variable Neighbourhood Search (VNS) which integrates the basic VNS with other complementary approaches from machine learning, statisti…
On the Minimum Labelling Spanning bi-Connected Subgraph problem
J. A. Moreno Perez, S. Consoli
We introduce the minimum labelling spanning bi-connected subgraph problem (MLSBP) replacing connectivity by bi-connectivity in the well known minimum labelling spanning tree proble…
Towards an intelligent VNS heuristic for the k-labelled spanning forest problem
Sergio Consoli, Josè Andrès Moreno Pèrez, Nenad Mladenovic
In a currently ongoing project, we investigate a new possibility for solving the k-labelled spanning forest (kLSF) problem by an intelligent Variable Neighbourhood Search (Int-VNS)…
Solving the minimum labelling spanning tree problem using intelligent optimization
Sergio Consoli, Nenad Mladenovic, Jose Andres Moreno-Perez
Given 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 n…