Tabu search for generalized minimum spanning tree problem

Authors:
Zhenyu Wang;Chan Hou Che;Andrew Lim
Affiliations:
School of Computer Science & Engineering, South China University of Technology, Guang Dong, P.R. China;Dept of Industrial Engineering and Logistics Management, Hong Kong Univ of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;School of Computer Science & Engineering, South China University of Technology, Guang Dong, P.R. China and Dept of Industrial Engineering and Logistics Management, Hong Kong Univ of Science and Te ...
Venue:
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Year:
2006

Citing 2
Cited 1

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

Networks
Heuristic Search for the Generalized Minimum Spanning Tree Problem

INFORMS Journal on Computing

An efficient algorithm for generalized minimum spanning tree problem

Proceedings of the 12th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Generalized Minimum Spanning Tree (GMST) problem requires spanning exactly one node from every cluster in an undirected graph. GMST problems are encountered in telecommunications network planning. A Tabu Search (TS) for the GMST problem is presented in this article. In our computational tests on 194 TSPLIB instances, TS found 152 optimal solutions. For those 42 unsolved instances, our algorithm has improved some previously best known solutions. Lower bounds of some unknown problems are improved by our heuristic relaxation algorithm.