Abstract
This is the second part of two papers addressing the study of the facial structure of the Steiner tree polyhedron. In this paper we 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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 231-246 |
| Number of pages | 16 |
| Journal | Mathematical Programming, Series B |
| Volume | 64 |
| Issue number | 2 |
| State | Published - Apr 1 1994 |
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Software
- Management Science and Operations Research
- Safety, Risk, Reliability and Quality
- Mathematics(all)
- Applied Mathematics