activity
20122018
most citedOn the Minimum Labelling Spanning bi-Connected Subgraph problem

3 citations · 3 across the 5 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

math.OC2012

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…