论文信息 - The Steiner tree problem II: Properties and classes of facets

The Steiner tree problem II: Properties and classes of facets

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.

M. R. Rao | Sunil Chopra

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] Charles J. Colbourn,et al. Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.

[3] M. R. Rao,et al. The Steiner tree problem I: Formulations, compositions and extension of facets , 1994, Math. Program..

[4] Ernest S. Kuh,et al. VLSI circuit layout : theory and design , 1985 .

[5] Gérard Cornuéjols,et al. The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..