@book{535a0453d56c46bc9c4a4c3fa934e025,
title = "The generalized minimum spanning tree problem",
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.",
keywords = "MSC-90C11, IR-65729, EWI-3362, MSC-90C35",
author = "P.C. Pop and Walter Kern and Still, \{Georg J.\}",
note = "Imported from MEMORANDA",
year = "2000",
language = "Undefined",
publisher = "University of Twente",
number = "1542",
address = "Netherlands",
}