The generalized steiner tree problem (GSTP) is a variant of the classical S
teiner tree problem (STP), in which a family of node clusters is given and
the tree must span at one node for each cluster. This note introduces a lif
ting procedure for obtaining polyhedral information on GSTP from polyhedral
results of STP. New classes of facet-defining inequalities are presented.
(C) 2000 Elsevier Science B.V. All rights reserved.