| Article ID: | iaor20013618 |
| Country: | Netherlands |
| Volume: | 100 |
| Issue: | 1/2 |
| Start Page Number: | 137 |
| End Page Number: | 144 |
| Publication Date: | Mar 2000 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Salazar Juan Jos |
| Keywords: | graphs |
The generalized Steiner tree problem (GSTP) is a variant of the classical Steiner tree problem (STP), in which a family of node clusters is given and the tree must span at least one node for each cluster. This note introduces a lifting procedure for obtaining polyhedral information on GSTP from polyhedral results of STP. New classes of facet-defining inequalities are presented.