| Article ID: | iaor19961320 |
| Country: | Netherlands |
| Volume: | 64 |
| Issue: | 2 |
| Start Page Number: | 231 |
| End Page Number: | 246 |
| Publication Date: | Apr 1994 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Chopra Sunil, Rao M.R. |
| Keywords: | Steiner problem |
This is the second part of two papers addressing the study of the facial structure of the Steiner tree polyhedron. In this paper the authors identify several classes of facet defining inequalities and relate them to special classes of graphs on which the Steiner tree problem is known to be NP-hard.