Skip to main content
SpringerLink
Log in

The Steiner tree problem II: Properties and classes of facets

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • S. Chopra and M.R. Rao, “The Steiner tree problem I: Formulations, compositions, and extensions of facets,” New York University Research Report No. 88-82, (1988a).

  • S. Chopra and M.R. Rao, “The Steiner tree problem II: Properties and classes of facets, “New York University Research Report No. 88-83 (1988b).

  • G. Cornuejols, J. Fonlups and D. Naddef, “The travelling salesman problem on a graph and some related integer polyhedra,”Mathematical Programming 33 (1985) 1–27.

    Google Scholar 

  • M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to Theory of NP-completeness (W.H. Freeman and Co., San Francisco, CA, 1979).

    Google Scholar 

  • T.C. Hu and E.S. Kuh,VLSI Circuit Layout: Theory and Design (IEEE Press, New York, 1985).

    Google Scholar 

  • A. Prodon, T.M. Liebling and H. Groflin, “Steiner's problem on two-trees,” preprint (1985).

  • J.A. Wald and C.J. Colbourn, “Steiner Trees Partial 2-trees and Minimum IFI Networks,”Networks 13 (1983) 159–167.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Managerial Economics and Decision Sciences, J.L. Kellogg Graduate School of Management, Northwestern University, 60208, Evanston, IL, USA

    Sunil Chopra

  2. Leonard N. Stern School of Business, New York University, 10012, New York, NY, USA

    M. R. Rao

Authors
  1. Sunil Chopra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. R. Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Corresponding author.

The author appreciates partial support from National Science Foundation Grants Nos. DSM-8606188 and ECS 8800281.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chopra, S., Rao, M.R. The Steiner tree problem II: Properties and classes of facets. Mathematical Programming 64, 231–246 (1994). https://doi.org/10.1007/BF01582574

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01582574

Keywords

Search

Navigation