The k-edge connected subgraph problem I: Polytopes and critical extreme points

Linear Algebra and Its Applications

Volumn 381, Issue 1-3, 2004, Pages 117-139

  Didi Biha, M ^a   Mahjoub, A R ^b  

^a UNIVERSITY OF AVIGNON   (France)

^b CNRS   (France)

Author keywords

Critical extreme point; Cut; k Edge connected graph; Polytope

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING; RELIABILITY; TREES (MATHEMATICS); VECTORS;

CRITICAL EXTREME POINTS; SUBGRAPHS;

GRAPH THEORY;

EID: 1342285560     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2003.11.007     Document Type: Article

References (27)

1. Baïou M., Mahjoub A.R. Steiner 2-edge connected subgraph polytopes on series-parallel graphs. SIAM J. Discrete Math. 10:1997;505-514.
2. Barahona F., Mahjoub A.R. On two-connected subgraph polytopes. Discrete Math. 147:1995;19-34.
3. Bienstock D., Brickell E.F., Monma C.L. On the structure of minimum weight. k-connected spanning networks SIAM J. Discrete Math. 3:1990;320-329.
4. Boyd S.C., Hao T. An integer polytope related to the design of survivable communication networks. SIAM J. Discrete Math. 5:1992;321-337.
5. Chopra S. The. k-edge connected spanning subgraph polyhedron SIAM J. Discrete Math. 7:1994;245-259.
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. R. Coullard, A. Rais, R.L. Rardin, D.K. Wagner, The 2-connected-Steiner subgraph polytope for series-parallel graphs, Technical Report, School of Industrial Engineering, Purdue University, 1991.
8. Coullard R., Rais A., Rardin R.L., Wagner D.K. Linear-time algorithm for the 2-connected Steiner subgraph problem on special classes of graphs. Networks. 23:1993;195-206.
9. 4-free graphs Discrete Appl. Math. 66:1996;33-43.
10. Didi Biha M., Mahjoub A.R. k-edge connected polyhedra on series-parallel graphs Oper. Res. Lett. 19:1996;71-78.
11. Didi Biha M., Mahjoub A.R. Steiner. k-edge connected subgraph polyhedra J. Combin. Optim. 4:2000;131-144.
12. Dinits E. Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Dokl. 11:1970;1277-1280.
13. Edmonds J., Karp R. Send-and-split method for minimum-concave-cost network flows. J. Assoc. Comput. Mach. 19:1972;248-264.
14. J. Fonlupt, A.R. Mahjoub, Critical extreme points of the 2-edge connected spanning subgraph polytope, Proceedings IPCO'99, LNCS 1610, (1999), pp. 166-183.
15. Fonlupt J., Naddef D. The traveling salesman problem in graphs with some excluded minors. Math. Programming. 53:1992;147-172.
16. Grötschel M., Lovász L., Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica. 1:1981;70-89.
17. Grötschel M., Monma C.L. Integer polyhedra arising from certain net work design problems with connectivity constraints. SIAM J. Discrete Math. 3:1990;502-523.
18. M. Grötschel, C.L. Monma, M. Stoer, Polyhedral approaches to network survivability, in: Reliability of computer and Communication Networks, 1991, pp. 121-141.
19. Grötschel M., Monma C.L., Stoer M. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper. Res. 40:1992;309-330.
20. Grötschel M., Monma C.L., Stoer M. Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM J. Optim. 2:1992;474-504.
21. Grotschel M., Monma C.L., Stoer M. Polyhedral and computational investigations for designing communication networks with high survivability requirements. Oper. Res. 43:1995;1012-1024.
22. H. Kerivin, A.R. Mahjoub, C. Nocq, (1,2)-Survivable networks: facets and branch-and-cut, in: M. Grötschel (Ed.), The Sharpest Cut, MPS-SIAM Series in Optimization, 2004, pp. 121-152.
23. C.W. Ko, C.L. Monma, Heuristic methods for designing highly survivable communication networks, Technical Report, Bell Communication Research, 1989.
24. Mahjoub A.R. Two-edge connected spanning subgraphs and polyhedra. Math. Programming. 64:1994;199-208.
25. Mahjoub A.R. On perfectly 2-edge connected graphs. Discrete Math. 95:1997;153-172.
26. Monma C.L., Shallcross D.F. Methods for designing communication networks with certain two-connected survivability constraints. Oper. Res. 37:1989;531-541.
27. Stoer M. Design of Survivable Networks. Lecture Notes in Mathematics. 1992;Springer-Verlag.