1. 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).
2. 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).
3. 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.
4. 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).
5. T.C. Hu and E.S. Kuh,VLSI Circuit Layout: Theory and Design (IEEE Press, New York, 1985).