Critical extreme points of the 2-Edge connected spannning subgraph polytope

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1610, Issue , 1999, Pages 166-182

  Fonlupt, Jean ^a   Mahjoub, Ali Ridha ^b  

^a SORBONNE UNIVERSITÉ   (France)

^b UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

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

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY;

2-EDGE CONNECTED GRAPH; CRITICAL EXTREME POINT; EXTREME POINTS; LINEAR RELAXATIONS; PARTIAL ORDER; POLYTOPES; REDUCTION OPERATION; SUBGRAPHS;

INTEGER PROGRAMMING;

EID: 84948995245     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_13     Document Type: Conference Paper

References (26)

1. Baïou, M., Mahjoub, A.R.: Steiner 2-edge connected subgraphs polytopes on series parallel graphs. SIAM Journal on Discrete Mathematics 10 (1997) 505-514
2. Barahona, F., Mahjoub, A.R.: On two-connected subgraphs polytopes. Discrete Mathematics 17 (1995) 19-34
3. Chopra, S.: Polyhedra of the equivalent subgraph problem and some edge connectivity problems. SIAM Journal on Discrete Mathematics 5 (1992) 321-337
4. Chopra, S.: The k-edge connected spanning subgraph polyhedron. SIAM Journal on Discrete Mathematics 7 (1994) 245-259
5. Coruégols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Mathematical Programming 33 (1985) 1-27
6. Coullard, R., Rais, A., Rardin, R.L., Wagner, D.K.: The 2-connected Steiner subgraph polytope for series-parallel graphs. Report No. CC-91-23, School of Indusrial Engineering, Purdue University (1991)
7. 4-free graphs. Discrete Applied Mathematics 66 (1996) 33-43
8. Dinits, E.A.: Algorithm for solution of a problem of maximum flow in a network unit with power estimation. Soziet. mat. Dokl. 11 (1970) 1277-1280
9. Edmonds, J., Karp, R.M.: Theoretical improvement in algorithm efficiency for network flow problems. J. of Assoc. Comp. Mach. 19 (1972) 254-264
10. Fonlupt, J., Naddef, D.: The traveling salesman problem in graphs with some excluded minors. Mathematical Programming 53 (1992) 147-172
11. Fonlupt, J., Mahjoub, A.R.: Critical extreme points of the 2-edge connected spanning subgraph polytope. Preprint (1998)
12. Goemans, M.X., Bertsimas, D.J.: Survivable Network, linear programming and the parsimonious property. Mathematical Programming 60 (1993) 145-166
13. Grötschel, M, Lovász, L., Schrijver, A.: The ellipsoid method and its consequences combinatorial optimization. Combinatorica 1 (1981) 70-89
14. Grötschel, M., Monma, C.: Integer polyhedra arising from certain network design problem with connectivity constraints. SIAM Journal of Discrete Mathematics 3 (1990) 502-523
15. Grötschel, M., Monma, C., Stoer, M.: Facets for polyhedra arising in the design of commumication networks with low-connectivity constraints. SIAM Journal on Optimization 2 (1992) 474-504
16. Grötschel, M., Monma, C., Stoer, M.: Polyhedral approaches to network survivability. In: Roberts, F., Hwang, F., Monma, C. (eds.): Reliability of Computer and Communication Networks, Vol. 5, Series in Discrete Mathematics and Computer Science AMS/ACM (1991) 121-141
17. Grötschel, M., Monma, C., Stoer, M.: Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Operations Research 40/2 (1992) 309-330
18. Grötschel, M., Monma, C., Stoer, M.: Polyhedral and Computational Ivestigation for designing communication networks with high suivability requirements. Operations Research 43/6 (1995) 1012-1024
19. Mahjoub, A.R.: Two-edge connected spanning subgraphs and polyhedra. Mathematical Programming 64 (1994) 199-208
20. Mahjoub, A.R.: On perfectly 2-edge connected graphs. Discrete Mathematics 170 (1997) 153-172
21. Monma, C., Munson, B.S., Pulleyblank, W.R.: Minimum-weight two connected spanning networks. Mathematical Programming 46 (1990) 153-171
22. Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)
23. Steiglitz, K.S, Weinen, P., Kleitmann, D.S.: The design of minimum cost suivable networks. IEEE Transactions and Circuit Theory 16 (1969) 455-460
24. Stoer, M.: Design of suivable Networks. Lecture Notes in Mathematics Vol. 1531, Springer, Berlin (1992)
25. th International Symposium on Mathematical Programming, MIT (1985)
26. Winter, P.: Generalized Steiner Problem in series-parallel networks. Journal of Algorithms 7 (1986) 549-566