Separation of partition inequalities for the (1,2)-survivable network design problem

Operations Research Letters

Volumn 30, Issue 4, 2002, Pages 265-268

  Kerivin, Hervé ^a,b   Mahjoub, Ali Ridha ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b ORANGE LABS   (France)

Author keywords

Partition inequalities; Separation algorithm; Submodular function; Survivable network

Indexed keywords

ALGORITHMS; POLYNOMIALS; THEOREM PROVING; VECTORS;

PARTITION INEQUALITIES;

GRAPH THEORY;

EID: 0036699045     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00182-7     Document Type: Article

References (19)

1. Baïou M., Barahona F., Mahjoub A.R. Separation of partition inequalities. Math. Oper. Res. 25:2000;243-254.
2. Barahona F. Separating from the dominant of the spanning tree polytope. Oper. Res. Lett. 12:1992;201-203.
3. Chopra S., Rao M.R. The Steiner tree problem I: formulations, compositions and extension of facets. Math. Program. 64:1994;209-230.
4. Cunningham W.H. Optimal attack and reinforcement of a network. J. ACM. 32:1985;549-561.
5. J. Fonlupt, A.R. Mahjoub, Critical extreme points of the 2-edge connected subgraph polytope, Proceedings IPCO'99, Lecture Notes of Computer Science, Vol. 1610, Springer, Berlin, 1999, pp. 166-183.
6. Fujishige S. Submodular Functions and Optimization. 1991;North-Holland, Amsterdam.
7. Goemans M.X., Bertsimas D.J. Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60:1993;145-166.
8. Grötschel M., Lovàsz L., Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica. 1:1981;169-197.
9. Grötschel M., Monma C.L., Stoer M. Facets for polyhedral arising in the design of communication networks with low-connectivity constraints. SIAM J. Optim. 2:1992;474-504.
10. Grötschel M., Monma C.L., Stoer M. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints. Oper. Res. 40:1992;309-330.
11. M. Grötschel, C.L. Monma, M. Stoer, Design of survivable networks, in: M.O. Ball et al. (Eds.), Handbooks in OR & MS, Vol. 7, 1995, pp. 617-671.
12. S. Iwata, L. Fleischer, S. Fujishige. A strongly polynomial-time algorithm for minimizing submodular functions, Proceedings of the 32nd ACM Symposium on Theory of Computing (2000) J. ACM 48 (2001) 761-777.
13. H. Kerivin, Réseaux fiables et Polyèdres, Ph.D. Dissertation, Université Blaise Pascal, Clermont-Ferrand, France, 2000.
14. C-W. Ko, C.L. Monma, Heuristic methods for designing highly survivable communication networks, Technical Report, Bellcore, 1989.
15. Lovász L. Submodular functions and convexity. Bachem A., Grötschel M., Korte B. Mathematical Programming - The State of the Art. 1983;234-257 Springer, Berlin.
16. Monma C.L., Shallcross D.F. Methods for designing communication networks with certain two-connected survivability constraints. Oper. Res. 37:1989;531-541.
17. M. Queyranne. A combinatorial algorithm for minimizing symmetric submodular function, in: Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 98-101.
18. Schrijver A. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combin. Theory, Ser. B. 80:2000;346-355.
19. Stoer M. Design of survivable networks. Lecture Notes in Mathematics. Vol. 1531:1992;Springer-Verlag, Berlin.