Steiner k-Edge Connected Subgraph Polyhedra

Journal of Combinatorial Optimization

Volumn 4, Issue 1, 2000, Pages 131-144

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

^a GERAD   (Canada)

^b UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

Cut; Facet; K edge connected subgraph; Polytope; Series parallel graph

Indexed keywords

EID: 0043186225     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1009893108387     Document Type: Article

References (38)

1. M. Baïou and A.R. Mahjoub, "Steiner 2-edge connected subgraph polytope on series-parallel graphs," SIAM J. Discrete Mathematics, vol. 10, pp. 505-514, 1997.
2. M. Baïou, "On the dominant of the Steiner 2-edge connected subgraph polytope," Discrete Applied Mathematics, to appear.
3. F. Barahona and A.R. Mahjoub, "On two-connected subgraph polytopes," Discrete Mathematics, vol. 147, pp. 19-34, 1995.
4. D. Bienstock, E.F. Brickell, and C.L. Monma, "On the structure of minimum weigth k-connected spanning networks," SIAM J. Discrete Mathematics, vol. 3, pp. 320-329, 1990.
5. S. Chopra, "The k-edge connected spanning subgraph polyhedron," SIAM J. Discrete Mathematics, vol. 7, pp. 245-259, 1994.
6. S. Chopra and M.R. Rao, "The Steiner tree problem II: Properties and classes of facets," Mathematical Programming, vol. 64, pp. 231-246, 1994.
7. N. Christofides and C.A. Whitlock, "Network synthesis with connectivity constraints - A survey," in Operational Research, vol. 81, J.P. Brans (Ed.), North Holland, 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," Mathematical Programming, vol. 33, pp. 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, 1991a.
10. 4-Free Graphs," Report No. 91-28, School of Industrial Engineering, Purdue University, 1991b.
11. M. Didi Biha, "Graphes k-arête connexes et polyèdres," Ph.D. Dissertation, Université de Bretagne Occidentale, Brest, France, 1998.
12. M. Didi Biha, H. Kerivin, and A.R. Mahjoub, "Steiner trees and polyhedra," Discrete Applied Mathematics, 1999.
13. M. Didi Biha and A.R. Mahjoub, "k-edge connected polyhedra on series-parallel graphs," Operations Research Letters, vol. 19, pp. 71-78, 1996.
14. R.J. Duffin, "Topology of series-parallel networks," Journal of Mathematical Analysis and Applications, vol. 10, pp. 303-318, 1965.
15. J. Edmonds, "Submodular functions, matroids and certain polyhedra," in Combinatorial Structures and Their Applications, R. Guy et al. (Ed.), Gordon and Breach: New York, 1970, pp. 69-87.
16. J. Edmonds, "Matroids and the greedy algorithm," Mathematical Programming, vol. 1, pp. 127-136, 1971.
17. R.E. Erickson, C.L. Monma, and A.F. Veinott, "Send-and-split method for minimum-concave-cost network flows," Mathematics of Operations Research, vol. 12, pp. 634-664, 1987.
18. J. Fonlupt and D. Naddef, "The traveling salesman problem in graphs with some excluded minors," Mathematical Programming, vol. 53, pp. 147-172, 1992.
19. J. Fonlupt and A. R. Mahjoub, "Critical Extreme Points of the 2-Edge Connected Subgraph Polytope," in Proceedings IPCO'99, Springer-Verlag, 1999, pp. 166-183. LNCS 1610.
20. M.X. Goemans, "The Steiner tree polytope and related polyhedra," Mathematical Programming, vol. 63, pp. 157-182, 1994.
21. M. Grötschel, L. Lovász, and A. Schrijver, "The ellipsoid method and its consequences in combinatorial optimization," Combinatorica, vol. 1, pp. 70-89, 1981.
22. M. Grötschel and C. Monma, "Integer polyhedra arising from certain network design problems with connectivity constraints," SIAM J. Discrete Mathematics, vol. 3, pp. 502-523, 1990.
23. M. Grötschel, C. Monma, and M. Stoer, "Polyhedral Approaches to Network Survivability," in Reliability of Computer and Communication Networks, F. Roberts, F. Hwang, and C.L. Monma (Eds.), AMS/ACM, 1991, pp. 121-141. Series Discrete Mathematics and Computer Science, vol. 5.
24. M. Grötschel, C. Monma, and M. Stoer, "Facets for polyhedra arising in the design of communication networks with low-connectivity constraints," SIAM J. Optimization, vol. 2, pp. 474-504, 1992a.
25. M. Grötschel, C. Monma, and M. Stoer, "Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints," Operations Research, vol. 40, no. 2, pp. 309-330, 1992b.
26. R. Halin, "Studies on minimally n-connected graphs," in Combinatorial Mathematics and its Applications, J.A. Welsh (Ed.), Academic Press: New York, 1971, pp. 129-136.
27. A.R. Mahjoub, "Two-edge connected spanning subgraphs and polyhedra," Mathematical Programming, vol. 64, pp. 199-208, 1994.
28. A.R. Mahjoub, "On perfectly two-edge connected graphs," Discrete Mathematics, vol. 170, pp. 153-172, 1997.
29. F. Margot, A. Prodon, and Th.M. Liebling, "Tree polytope on 2-trees," Mathematical Programming, vol. 63, pp. 183-191, 1994.
30. C.L. Monma, B.S. Munson, and W.R. Pulleyblank, "Minimum-weight two connected spanning networks," Mathematical Programming, vol. 46, pp. 153-171, 1990.
31. H. Nagamochi and T. Ibaraki, "Computing edge connectivity in multigraphs and capacitated graphs," SIAM. J. Discrete Mathematics, vol. 5, pp. 54-66, 1992.
32. K. Steiglitz, P. Weiner, and D.J. Kleitman, "The design of minimum cost survivable networks," IEEE Transactions on Circuit Theory, vol. 16, pp. 455-460, 1969.
33. M. Stoer, "Design of survivable networks," in Lecture Notes in Mathematics, vol. 1531, Springer-Verlag, 1992.
34. M. Stoer and F. Wagner, "A Simple Min Cut Algorithm," in Proceedings of the 1994 European Symposioum on Algorithms ESA'94, Springer Verlag, 1994, pp. 141-147. LNCS 855.
35. S. Voss, "Steiner-probleme in graphen," in Mathematical Systems in Economics, Hain, 1990.
36. P. Winter, "Generalized Steiner Problem in Halin Networks," in Proceedings of the 12th International Symposium on Mathematical Programming, MIT, 1985.
37. R Winter, "Generalized Steiner problem in series-parallel networks," Journal of Algorithms, vol. 7, pp. 549-566, 1986.
38. P. Winter, "Steiner problems in networks: A survey," Networks, vol. 17, pp. 129-167, 1987.