Relaxation methods for the Generalized Minimum Spanning Tree Problem


Pop, P.C. and Kern, W. and Still, G. and Faigle, U. (2001) Relaxation methods for the Generalized Minimum Spanning Tree Problem. In: Johann Hurink & Stefan Pickl & Hajo Broersma & Ulrich Faigle (Eds.), 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 8 . Elsevier, pp. 76-79.

[img] PDF
Restricted to UT campus only

Abstract:Given an undirected graph whose nodes are partitioned into a number of clusters, the Generalized Minimum Spanning Tree problem (denoted GMSTP) is then to find a minimum-cost tree which includes exactly one node from each cluster. We present several integer programming formulations of the problem and compare the polyhedra defined by the LP relaxations of these formulations. Based on a new formulation of the GMSTP we give an heuristic solution, a lower bound procedure and discuss the advantages of our approach in comparison with an erlier method.
Item Type:Book Section
Copyright:© 2001 Elsevier
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page