On the linear relaxation of the 2-node connected subgraph polytope

Discrete Applied Mathematics

Volumn 95, Issue 1-3, 1999, Pages 389-416

  Mahjoub, A R ^a,b   Nocq, C ^a,c  

^a UNIVERSITÉ DE BRETAGNE OCCIDENTALE   (France)

^b UNIVERSITÉ CLERMONT AUVERGNE   (France)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

2 node connected graph; Critical extreme point; Cut; Polytope

Indexed keywords

EID: 0041777739     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00088-8     Document Type: Article

References (34)

1. M. Baïou, A.R. Mahjoub, Steiner 2-edge connected subgraph polytopes on series-parallel graphs, SIAM J. Discrete Math. 10 (3) (1997) 505-514.
2. F. Barahona, A.R. Mahjoub, On two-connected subgraph polytopes, Discrete Math. 147 (1995) 19-34.
3. D. Bienstock, E.F. Brickell, C.L. Monma, On the structure of minimum weight k-connected spanning networks, SIAM J. Discrete Math. 3 (1990) 320-329.
4. S. Chopra, Polyhedra of the equivalent subgraph problem and some edge connectivity problems, SIAM J. Discrete Math. 5 (1992) 321-337.
5. S. Chopra, The k-edge connected spanning subgraph polyhedron, SIAM J. Discrete Math. 7 (1994) 245-259.
6. S. Chopra, M. Stoer, Private communication.
7. N. Christofides, C.A. Whitlock, Network synthesis with connectivity constraints-A survey, in: J.P. Brans (Ed.), Operational Research, vol. 81, North-Holland, Amsterdam, 1981, pp. 705-723.
8. G. Cornuéjols, J. Fonlupt, D. Naddef, The traveling salesman problem on a graph and some related integer polyhedra, Math. Programm. 33 (1985) 1-27.
9. R. Coullard, A. Rais, R.L. Rardin, D.K. Wagner, The 2-connected-Steiner subgraph polytope for series-parallel graphs, Report No. CC-91-23, School of Industrial Engineering, Purdue University (1991).
10. R. Coullard, A. Rais, R.L. Rardin, D.K. Wagner, Linear-time algorithm for the 2-connected Steiner subgraph problem on special classes of graphs, Networks 23 (1993) 195-206.
11. 4-free graphs, Discrete Appl. Math. 66 (1996) 33-43.
12. M. Didi Biha, A.R. Mahjoub, k-Edge connected polyhedra on series-parallel graphs, Oper. Res. Lett. 19 (1996) 71-78.
13. E.A. Dinits, Algorithm for solution of a problem of maximum flow in a network with power estimation, Soviet Math. Dokl. 11 (1970) 1277-1280.
14. J. Edmonds, R.M. Karp, Theoretical improvement in algorithm efficiency for network flow problems, J. Assoc. Comput, Mach. 19 (1972) 248-264.
15. R.E. Erikson, C.L. Monma, A.F. Veinott, Jr., Send-and-split method for minimum-concave-cost network flows, Math. Oper. Res. 12 (1987) 634-664.
16. J. Fonlupt, A.R. Mahjoub, Critical extreme points of the 2-edge connected subgraph polytope, Preprint, 1997.
17. J. Fonlupt, D. Naddef, The traveling salesman problem in graphs with some excluded minors, Math. Programm. 53 (1992) 147-172.
18. G.N. Frederickson, J. Ja'Ja', On the relationship between the biconnectivity augmentations and the traveling salesman problem, Theoret. Comput. Sci. 13 (1982) 189-201.
19. M.X. Goemans, D.J. Bertsimas, Survivable networks, linear programming and the parsimonious property, Math. Programm. 60 (1993) 145-166.
20. M. Grötschel, L. Lovász, Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1 (1981) 70-89.
21. M. Grötschel, C. Monma, Integer polyhedra arising from certain network design problems with connectivity constraints, SIAM J. Discrete Math. 3 (4) (1990) 502-523.
22. 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, Series Discrete Mathematics and Computer Science, vol. 5, AMS/ACM, Providence, RI, 1991, pp. 121-141.
23. M. Grötschel, C. Monma, M. Stoer, Facets for polyhedra arising in the design of communication networks with low-connectivity constraints, SIAM J. Optim. 2 (3) (1992) 474-504.
24. M. Grötschel, C. Monma, M. Stoer, Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints, Oper. Res. 40 (2) (1992) 309-330.
25. M. Grötschel, C. Monma, M. Stoer, Polyhedral and computational investigations for designing communication networks with high survivability requirements, Oper. Res. 43 (6) (1995) 1012-1024.
26. A.R. Mahjoub, Two-edge connected spanning subgraphs and polyhedra, Math. Programm. 64 (1994) 199-208.
27. A.R. Mahjoub, On perfectly 2-edge connected graphs, Discrete Math. 170 (1997) 153-172.
28. C.L. Monma, B.S. Munson, W.R. Pulleyblank, Minimum-weight two connected spanning networks, Math. Programm. 46 (1990) 153-171.
29. H. Nagamochi, T. Ibaraki, Computing edge connectivity in multigraphs and capacitated graphs, SIAM J. Discete Math. 5 (1992) 54-66.
30. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimisation, Wiley, New York, 1988.
31. G. Reinelt, TSPLIB - a traveling salesman problem library, ORSA J. Comput. 3 (1991) 376-384.
32. K. Steiglitz, P. Weiner, D.J. Kleitman, The design of minimum cost survivable networks, IEEE Trans. Circuit Theory 16 (1969) 455-460.
33. M. Stoer, Design of Survivable Networks, Lecture Notes in Mathematics, vol. 1531, Springer, Berlin, 1992.
34. M. Stoer, F. Wagner, A simple min cut algorithm, in Proceedings of the 1994 European Symposium on Algorithms ESA'94, Lecture Notes in Computer Science, vol. 855, Springer, Berlin, 1984, pp. 141-147.