On perfectly two-edge connected graphs

Discrete Mathematics

Volumn 170, Issue 1-3, 1997, Pages 153-172

  Mahjoub, Ali Ridha ^a  

^a UNIVERSITÉ DE BRETAGNE OCCIDENTALE   (France)

Author keywords

2 edge connected graphs; Polytopes; Separation problem

Indexed keywords

EID: 0042877877     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00004-0     Document Type: Article

References (30)

1. M. Baïou and A.R. Mahjoub, 'The 2-edge connected Steiner subgraph polytope of a series-parallel graph, SIAM J. Discrete Math., to appear.
2. F. Barahona and A.R. Mahjoub, On two-connected subgraph polytopes, Discrete Math. 147 (1995) 19-34.
3. S. Chopra, The k-edge connected spanning subgraph polyhedron, SIAM J. Discrete Math. (1994) 245-259.
4. N. Christofides, The traveling salesman problem, in: N. Christofides, ed., Combinatorial Optimization (John Wiley, New York, 1979) 131-150.
5. 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) 705-723.
6. G. Cornuéjols, J. Fonlupt and D. Naddef, 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 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.
8. 4-free graphs, Report No. 91-28, School of Industrial Egineering, Purdue University.
9. 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.
10. R.J. Duffin, Topology of series-parallel networks, J. Math. Anal. Appl. 10 (1965) 303-318.
11. J. Edmonds, Maximum matching and a polyhedron with O, 1-vertices, J. Res. National Bur. Stand. B 69 (1965) 125-130.
12. J. Edmonds and R.M. Karp, Theoretical improvement in algorithmic efficiency for network flow problems, J. Assoc. Comput. Mach. 19 (1972) 248-264.
13. R.E. Erikson, C.L. Monma and A.F. Veinott Jr., Send- and-split method for minimum-concave-cost network flows, Math. Oper. Res. 12 (1987) 634-664.
14. J. Fonlupt and D. Naddef, The traveling salesman problem in graphs with some excluded minors, Math. Programming 53 (1992) 147-172.
15. L.R. Ford and D.R. Fulkerson, Maximal flow through a network, Can. J. Math. 8 (1956) 399-404.
16. G.N. Frederickson and J. Ja'Ja', On the relationship between the biconnectivity augmentations and traveling salesman problem, Theoret. Comput. Sci. 13 (1982) 189-201.
17. M.X. Goemans and D.J. Bertsimas, Survivable networks, linear programming relaxations and the parsimonious property, Math, programming 60 (1993) 145-166.
18. M. Grötschel, L. Lovasz and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1 (1981) 70-89.
19. M. Grötschel and C. Monma, Integer polyhedra arising from certain network design problems with connectivity constraints, SIAM J. Disc. Math 3 (1990) 502-523.
20. M. Grötschel, C. Monma and M. Stoer, Polyhedral approach to network survivability, in: F. Roberts, F. Hwang, C.L. Monma, eds., Reliability of Computer and Communication Networks, Vol. 5, DIMACS Series (AMS/ACM, New York, 1991) 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 (1992) 474-504.
22. M. Grötschel, C. Monma and M. Stoer, Computational results with a cutting plane algorithm for designing communication networks with low connectivity constraints, Oper. Res. 40 (1992) 309-330.
23. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy-Kan and D.B. Shmoys, The Traveling Salesman Problem (John Wiley, New York, 1985).
24. A.R. Mahjoub, Two-edge connected spanning subgraphs and polyhedra, Math. Programming 64 (1994) 199-208.
25. C.L. Monma, B.S. Munson and W.R. Pulleyblank, Minimum-weight two connected spanning networks, Math. Programming 46 (1990) 153-171.
26. R.G. Parker and R.L. Rardin, The traveling salesman problem: an update of research, Naval Res. Logist. Quart. 30 (1983) 69-96.
27. K. Steiglitz, P. Weiner and D.J. Kleitman, The design of minimum cost survivable networks, IEEE Trans. Circuit Theory 16 (1969) 455-460.
28. M. Stoer, Design of Survivable Networks, Lecture Notes in Mathematics, Vol. 1531 (Springer, Berlin, 1992).
29. P. Winter, Generalized Steiner problem in Halin networks, in: Proc. 12th Internat. Symp. on Mathematical Programming (MIT, Cambridge, 1985).
30. P. Winter, Generalized Steiner problem in series-parallel networks, J. Algorithms 7 (1986) 549-566.