k-edge connected polyhedra on series-parallel graphs

Operations Research Letters

Volumn 19, Issue 2, 1996, Pages 71-78

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

^a UNIVERSITÉ DE BRETAGNE OCCIDENTALE   (France)

Author keywords

k edge connected subgraphs; Polytopes; Series parallel graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; TELECOMMUNICATION NETWORKS;

COST SURVIVABLE NETWORKS; CUTTING PLANE ALGORITHM; K EDGE CONNECTED SUBGRAPHS; POLYTOPES; SERIES PARALLEL GRAPHS;

GRAPH THEORY;

EID: 0030212901     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(96)00015-6     Document Type: Article

References (27)

1. M. Baïou and A.R. Mahjoub, "The 2-edge connected Steiner subgraph polytope of series-parallel graphs", to appear in SIAM J. Discrete Math.
2. F. Barahona, "Separating from the dominant of the spanning tree polytope", Oper. Res. Lett. 12, 201-204 (1992).
3. F. Barahona and A.R. Mahjoub, "On two-connected subgraph polytopes", Discrete Math. 147, 19-34 (1995).
4. D. Bienstock, E.F. Brickell and C.L. Monma, "On the structure of minimum weight k-connected spanning networks", SIAM J. Discrete Math. 3, 320-329 (1990).
5. S. Chopra, "The k-edge connected spanning subgraph polyhedron", SIAM J. Discrete Math. 7, 245-259 (1994).
6. S. Chopra and M. Stoer, private communication.
7. N. Christofides and 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 and D. Naddef, "The traveling salesman problem on a graph and some related integer polyhedra", Math. Programming 33, 1-27 (1985).
9. R. Coullard, A. Rais, R.L. Rardin and D.K. Wagner, "The 2-connected Steiner subgraph polytope for series-parallel graphs", Report No. CC-91-23, School of Industrial Engineering, Purdue University.
10. 4-free graphs", Report No. 91-28, School of Industrial Engineering, Purdue University.
11. W.H. Cunningham, "Optimal attack and reinforcement of a network", J. Assoc. Comput. Machine 32, 549-561 (1985).
12. R.J. Duffin, "Topology of series-parallel networks", J. Math. Analysis Appl. 10, 303-318 (1965).
13. J. Edmonds, "Submodular functions, matroids and certain polyhedra", in: R. Guy et al. (eds.), Combinatorial Structures and Their Applications, Gordon and Breach, New York, 1970, pp. 69-87.
14. J. Edmonds, "Matroids and the greedy algorithm", Math. Programming 1, 127-136 (1971).
15. R.E. Erikson, C.L. Monma and A.F. Veinott, "Send-and-split method for minimum-concave-cost network flows", Math. Oper. Res. 12, 634-664 (1987).
16. J. Fonlupt and D. Naddef, "The traveling salesman problem in graphs with some excluded minors", Math. Programming 53, 147-172 (1992).
17. M.X. Goemans, "The Steiner tree polytope and related polyhedra", Math. Programming 63, 157-182 (1994).
18. M. Grötschel, L. Lovász and Schrijver, "The ellipsoid method and its consequences in combinatorial optimization", Combinatorica 1, 70-89 (1981).
19. M. Grötschel and C. Monma, "Integer polyhedra arising from certain network design problems with connectivity constraints", SIAM J. Discrete Math. 3, 502-523 (1990).
20. M. Grötschel, C. Monma and M. Stoer, "Polyhedral approaches to network survivability", in: F. Roberts, F. Hwang and C.L Monma (eds.), Reliability of computer and Communication Networks, Vol. 5, Series Discrete Mathmatics and Computer Science, AMS/ACM, 1991, pp. 121-141.
21. M. Grötschel, C. Monma and M. Stoer, "Facets for polyhedra arising in the design of communication networks with low-connectivity constraints", SIAM J. Optim. 2, 474-504 (1992).
22. M. Grötschel, C. Monma and Stoer, "Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints", Oper. Res. 40, 309-330 (1992).
23. A.R. Mahjoub, "Two-edge connected spanning subgraphs and polyhedra", Math. Programming 64, 199-208 (1994).
24. F. Margot, A. Prodon and Th.M. Liebling, "Tree polytope on 2-tees", Math. Programming 63, 183-191 (1994).
25. W.R. Pulleyblank, "Polyhedral combinatorics", in: G.L. Nemhauser et al. (eds.), Handbooks in OR-MS, Vol. 1, North-Holland, Amsterdam, pp. 371-446.
26. K. Steiglitz, P. Weiner and D.J. Kleitman, "The design of minimum cost survivable networks", IEEE Trans. Circuit Theory 16, 455-460 (1969).
27. M. Stoer, "Design of survivable networks", Lecture Notes in Mathematics, Vol. 1531, Springer, Berlin, 1992.