Polyhedral results for two-connected networks with bounded rings

Mathematical Programming, Series B

Volumn 93, Issue 1, 2002, Pages 27-54

  Fortz, B ^a   Labbe M ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING;

BOUNDED RINGS; BRANCH-AND-CUT ALGORITHM; POLYHEDRON; TWO-CONNECTED NETWORKS;

NUMERICAL ANALYSIS;

EID: 0942281965     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0299-9     Document Type: Article

References (16)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D. (1974): The design and analysis of computer algorithms. Addison-Wesley
2. Barahona, F. (1992): Separating from the dominant of the spannins tree polytope. Oper. Res. Lett. 12, 201-203
3. Cunningham, W.H. (1985): Optimal attack and reinforcement of a network. J. ACM 32, 549-561
4. Didi Biha, M., Mahjoub, A.R. (1996): A'-edge connected polyhedra on series-parallel graphs. Oper. Res. Lett. 19, 71-78
5. Fortz, B. (2000): Design of Survivable Networks with Bounded Rings, Vol. 2 of Network Theory and Applications. Kluwer Academic Publishers
6. Fortz, B., Labbé, M., Maffioli, F. (2000): Solving the two-connected network with bounded meshes problem. Oper. Res. 48(6), 866-877
7. Garey, M.R., Johnson, D.S. (1979): Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco
8. Gomory, R.E., Hu, T.C. (1961): Multi-terminal network flows. SIAM J. Appl. Math. 9, 551-570
9. Grötschel, M., Monma, C.L. (1990): Integer polyhedra arising from certain design problems with connectivity constraints. SIAM J. Discrete Math. 3, 502-523
10. Grötschel, M., Monma, C.L., Stoer, M. (1992): Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper. Res. 40(2), 309-330
11. Grötschel, M., Monma, C.L., Stoer, M. (1992): Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM J. Optim. 2(3), 474-504
12. Grötschel, M., Monma, C.L., Stoer, M. (1995): Design of Survivable Networks, Vol. 7 on Network models of Handbooks in OR/MS, Chapter 10, pp. 617-672. North-Holland
13. Mahjoub, A.R. (1994): Two-edge connected spanning subgraphs and polyhedra. Math. Program. 64, 199-208
14. Sassano, A. (1989): On the facial structure of the set covering polytope. Math. Program. 44, 181-202
15. Stoer, M. (1992): Design of Survivable Networks, Vol. 1531 of Lecture Notes in Mathematics. Springer-Verlag
16. Thienel, S. (1995): ABACUS - A Branch-And-Cut System. PhD thesis, Universität zu Köln