Constraint Generation for Network Reliability Problems

Annals of Operations Research

Volumn 106, Issue 1-4, 2001, Pages 155-180

  Shaio, Jack ^a  

^a Vivace Network Inc   (United States)

Author keywords

Mathematical programming; Multicommodity flows; Network reliability; Networks graphs

Indexed keywords

EID: 0035566214     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1014561725448     Document Type: Article

References (22)

1. A. Assad, Multicommodity network flows - a survey, Networks 8 (1978) 37-91.
2. D. Awduche et al., Requirements for traffic engineering over MPLS, Internet Engineering Task Force RFC 2702 (1999).
3. D. Awduche, Y. Xue et al., Carrier optical services framework and associated UNI requirements, draft-many-carrier-framework-uni-00.txt, Internet Engineering Task Force (2000) (work in progress).
4. M. Fisher, Lagrangean relaxation method for solving integer linear programming problems, Management Science 27 (1978) 1-18.
5. B. Gavish, Augmented Lagrangean based algorithms for centralized network design, IEEE Trans. Comm. COM-33 (1985) 1247-1257.
6. B. Gavish and H. Pirkul, Efficient algorithms for solving multi-constraint zero-one knapsack problems to optimality, Mathematical Programming 31 (1985) 78-105.
7. B. Gendron, T.G. Crainic and A. Fangioni, Multicommodity capacitated network design, in: Telecommunications Network Planning, eds. B. Sanso and P. Soriano (Kluwer Academic, 1999).
8. M. Gondran and M. Minoux, Graphs and Algorithms (Wiley, 1987). French edition 1979.
9. M. Grotschel, C.L. Monma and M. Stoer, Design of survivable networks, in: Network Models, eds. M.O. Ball et al., Handbooks in Operations Research and Management Science, Vol. 7 (Elsevier, 1995).
10. W.D. Grover, R.R. Iraschko and Y. Zheng, Comparative methods and issues in design of mesh-restorable STM and ATM networks, in: Telecommunications Network Planning, eds. B. Sanso and P. Soriano (Kluwer Academic, 1999).
11. M. Held, P. Wolfe and H. Crowder, Validation of subgradient optimization, Mathematical Programming 6 (1974) 62-88.
12. R.R. Iraschko, M.H. Macgregor and W.D. Grover, Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks, IEEE/ACM Transactions on Networking 6 (1998) 325-326.
13. M. Iri, On an extension of the maximum-flow minimum-cut theorem to multicommodity flows, J. Operations Research Society of Japan 13(3) (1971) 129-135.
14. J. Kennington, Multicommodity flows - a state of the art survey, Operations Research 26 (1978) 209-236.
15. M. Minoux, Optimum synthesis of a network with non-simultaneous multicommodity flow requirements, in: Studies on Graphs and Discrete Programming, ed. P. Hansen (North-Holland, 1981).
16. M. Minoux, Mathematical Programming (Wiley, 1986).
17. M. Minoux, Network synthesis and dynamic network optimization, Annals of Discrete Mathematics 31 (1987) 283-324.
18. M. Minoux and J. Serrault, Subgradient optimization and large scale programming: an application to network synthesis with security constraints, RAIRO 15 (1981) 185-203.
19. K. Murty, Linear and Combinatorial Programming (Wiley, 1976).
20. S.J. Phillips and J.R. Westbrook, Approximation algorithms for restoration capacity planning, in: European Symposium on Algorithms, ed. J. Nesetril, Lecture Notes in Computer Science, Vol. 1643 (Springer, 1999).
21. E. Rosen, A. Viswanathan and R. Callon, Multiprotocol label switching architecture, Internet Engineering Task Force RFC 3031 (2001).
22. P. Soriano, C. Wyrants, R. Segain, M. Labbe, M. Gendreau and B. Fortz, Design and dimensioning of survivable SDH/SONET Networks, in: Telecommunications Network Planning, eds. B. Sanso and P. Soriano (Kluwer Academic, 1999).