The Dominant of the 2-connected-Steiner-subgraph Polytope for W4-free Graphs

Abstract This paper presents a linear-inequality description of the dominant of the polytope of the 2-connected Steiner subgraphs of a given W4-free graph. For the special case of 2-connected spanning subgraphs, a description of the polytope is given. The latter contains the Traveling-Salesman polytope for W4-free graphs as a face.

[1]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[2]  Clyde L. Monma,et al.  Minimum-weight two-connected spanning networks , 1990, Math. Program..

[3]  Pawel Winter,et al.  Generalized Steiner Problem in Series-Parallel Networks , 1986, J. Algorithms.

[4]  Ali Ridha Mahjoub,et al.  On 2-Connected Subgraph Polytopes , 1992, IPCO.

[5]  Ronald L. Rardin,et al.  Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs , 1993, Networks.

[6]  A. Pascu.  Operational research '81: J.P. Brans (Ed.) Proceedings of the Ninth IFORS International Conference on Operational Research, Hamburg, Germany, July 20–24, 1981, North-Holland, Amsterdam, 1981, xx + 984 pages, Dfl.250.000 , 1982 .

[7]  Ali Ridha Mahjoub,et al.  Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor , 1994, SIAM J. Discret. Math..

[8]  D. R. Fulkerson.  NETWORKS, FRAMES, BLOCKING SYSTEMS , 1967 .

[9]  W. T. Tutte.  Connectivity in graphs , 1966 .

[10]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[11]  Ali Ridha Mahjoub,et al.  On two-connected subgraph polytopes , 1995, Discret. Math..

[12]  Martin Grötschel,et al.  Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..

[13]  R. J. Duffin,et al.  The extremal length of a network , 1962 .

[14]  E. L. Johnson,et al.  Four problems on graphs with excluded minors , 1989, Math. Program..

[15]  Ali Ridha Mahjoub,et al.  Two-edge connected spanning subgraphs and polyhedra , 1994, Math. Program..

[16]  C. Monma,et al.  Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints , 1989, Oper. Res..

[17]  R. Duffin.  Topology of series-parallel networks , 1965 .

[18]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[19]  Martin Grötschel,et al.  Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints , 1990, SIAM J. Discret. Math..

[20]  Martin Grötschel,et al.  Polyhedral Approaches to Network Survivability , 1989, Reliability Of Computer And Communication Networks.