On the dominant of the Steiner 2-edge connected subgraph polytope

Discrete Applied Mathematics

Volumn 112, Issue 1-3, 2001, Pages 3-10

  Baïou, Mourad ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Dominant; Perfectly Steiner 2 edge connected graph; Polytope

Indexed keywords

EID: 0035885226     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00306-1     Document Type: Article

References (20)

1. M. Baïou, Le problème du sous-graphe Steiner 2-arête connexe: Approche polyédrale, Ph.D. dissertation, No. 1639, Université de Rennes 1, Rennes, France, 1996.
2. Baïou M., Mahjoub A.R. Steiner 2-edge connected subgraph polytopes on series-parallel graphs. SIAM J. Discrete Math. 10:1997;505-514.
3. Barahona F., Mahjoub A.R. On two-connected subgraph polytopes. Discrete Math. 147:1995;19-34.
4. Chopra S. The. k -edge connected spanning subgraph polyhedron SIAM J. Discrete Math. 7:1994;245-259.
5. Christofides N., Whitlock C.A. Network synthesis with connectivity constraints-A survey. Brans J.P. Operational Research 81. 1981;705-723 North-Holland, Amsterdam.
6. Cornuéjols G., Fonlupt J., Naddef D. The traveling salesman problem on a graph and some related integer polyhedra. Math. Programming. 33:1985;1-27.
7. 4 -free graphs Discrete Appl. Math. 66:1996;33-43.
8. Didi Biha M., Mahjoub A.R. k -edge connected polyhedra on series-parallel graphs Oper. Res. Lett. 19:1996;71-78.
9. Duffin R.J. Topology of series-parallel networks. J. Math. Anal. Appl. 10:1965;303-318.
10. J. Fonlupt, A.R. Mahjoub, Critical extreme points of the 2-edge connected spanning subgraph polytope, Proceedings of the Seventh International IPCO Conference, Graz, Austria, Lectures Notes in Computer Science, Vol. 1610, Springer, Berlin, 1999, to appear.
11. M. Grötschel, C. Monma, M. Stoer, Polyhedral approaches to network survivability, in: F. Roberts, F. Hwang, C.L. Monma (Eds.), Reliability of Computer and Communication Networks, Vol. 5, Series Discrete Mathematics and Computer Science, AMS/ACM, 1991, pp. 121-141.
12. Grötschel M., Monma C., Stoer M. Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM J. Optim. 2:1992;474-504.
13. Grötschel M., Monma C., Stoer M. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper. Res. 40:1992;309-330.
14. Mahjoub A.R. Two-edge connected spanning subgraphs and polyhedra. Math. Programming. 64:1994;199-208.
15. Mahjoub A.R. On perfectly two-edge connected graphs. Discrete Math. 170:1997;153-172.
16. Monma C.L., Munson B.S., Pulleyblank W.R. Minimum-weight two connected spanning networks. Math. Programming. 46:1990;153-171.
17. Steiglitz K., Weiner P., Kleitman D.J. The design of minimum cost survivable networks. IEEE Trans. Circuit Theory. 16:1969;455-460.
18. M. Stoer, Design of Survivable Networks, Lecture Notes in Mathematics, Vol. 1531, Springer, Berlin, 1992.
19. P. Winter, Generalized Steiner problem in Halin networks, Proceedings of the 12th International Symposium on Mathematical Programming, MIT Press, Cambridge, 1985.
20. Winter P. Generalized Steiner problem in series-parallel networks. J. Algorithms. 7:1986;549-566.