@book{c1c86df45c6f4447ac4e4a1aa1a10f95,

title = "The generalized minimum spanning tree polytope and related polytopes",

abstract = "The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each cluster. A different version of the problem, called E-GMST arises when exactly one node from each cluster has to be visited. Both GMST problem and E-GMST problem are NP-hard problems. In this paper, we model GMST problem and E-GMST problem as integer linear programs and study the facial structure of the corresponding polytopes.",

keywords = "MSC-05C05, MSC-90C11, IR-65774, MSC-90B10, EWI-3407, MSC-90C27",

author = "P.C. Pop",

note = "Imported from MEMORANDA",

year = "2001",

language = "English",

series = "Memorandum",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1587",

}