Back to University of Twente portal
The generalized minimum spanning tree problem
Pop, P.C. and Kern, W. and Still, G.J. (2000) The generalized minimum spanning tree problem. [Report]
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 128Kb |
| Abstract: | We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard. We introduce a new mixed integer programming formulation of the problem which contains a polynomial number of constraints and a polynomial number of variables. Based on this formulation we give an heuristic solution, a lower bound procedure and an upper bound procedure and present the advantages of our approach in comparison with an earlier method. We present a solution procedure for solving GMST problem using cutting planes. |
| Item Type: | Report |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/65729 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page