Steiner tree problem II: properties and classes of facets

Sunil Chopra*, M. R. Rao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)231-246
Number of pages16
JournalMathematical Programming, Series B
Issue number2
StatePublished - 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


Dive into the research topics of 'Steiner tree problem II: properties and classes of facets'. Together they form a unique fingerprint.

Cite this