The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm

Authors:
Affiliations:
Venue:
Networks
Year:
2004

Citing 0
Cited 6

Heuristic Search for the Generalized Minimum Spanning Tree Problem

INFORMS Journal on Computing
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem

Journal of Heuristics
Tabu search for generalized minimum spanning tree problem

PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
A GRASP-based approach to the generalized minimum spanning tree problem

Expert Systems with Applications: An International Journal
An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Regional appearance modeling based on the clustering of intensity profiles

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning Tree Problem (GMSTP). Given an undirected graph whose vertex set is partitioned into clusters, the GMSTP consists of determining a minimum-cost tree including exactly one vertex per cluster. Applications of the GMSTP are encountered in telecommunications. An integer linear programming formulation is presented and new classes of valid inequalities are developed, several of which are proved to be facet-defining. A branch-and-cut algorithm and a tabu search heuristic are developed. Extensive computational experiments show that instances involving up to 160 or 200 vertices can be solved to optimality, depending on whether edge costs are Euclidean or random. © 2004 Wiley Periodicals, Inc.