The Steiner tree problem I: Formulations, compositions and extension of facets

In this paper we give some integer programming formulations for the Steiner tree problem on undirected and directed graphs and study the associated polyhedra. We give some families of facets for the undirected case along with some compositions and extensions. We also give a projection that relates the Steiner tree polyhedron on an undirected graph to the polyhedron for the corresponding directed graph. This is used to show that the LP-relaxation of the directed formulation is superior to the LP-relaxation of the undirected one.

[1]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[2]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[3]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[4]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[5]  Alfred V. Aho,et al.  Rectilinear steiner trees: Efficient special-case algorithms , 1977, Networks.

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

[7]  Yash P. Aneja,et al.  An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[8]  M. Grötschel,et al.  New aspects of polyhedral theory , 1982 .

[9]  Egon Balas,et al.  The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.

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

[11]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[12]  Martin Farber,et al.  Steiner trees, connected domination and strongly chordal graphs , 1985, Networks.

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

[14]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[15]  Pawel Winter.  Steiner problem in Halin networks , 1987, Discret. Appl. Math..

[16]  S. Chopra.  On the spanning tree polyhedron , 1989 .

[17]  M. R. Rao,et al.  Solving the Steiner Tree Problem on a Graph Using Branch and Cut , 1992, INFORMS J. Comput..