A global optimization algorithm for reliable network design

European Journal of Operational Research

Volumn 200, Issue 1, 2010, Pages 1-8

  Desai, Jitamitra ^a   Sen, Suvrajeet ^b  

^a Lehigh University   (United States)

^b The Ohio State University   (United States)

Author keywords

Branch and bound; Convexification techniques; Global optimization; Reformulation Linearization Technique (RLT); Reliable network design; Resource allocation

Indexed keywords

APPROXIMATION TECHNIQUES; BRANCH AND BOUNDS; BRANCH-AND-BOUND; CAPACITY CONSTRAINTS; COMPUTATIONAL RESULTS; CONVERGENCE PROPERTIES; CONVEXIFICATION TECHNIQUES; FAILURE PROBABILITY; FLOW BALANCE; GLOBAL OPTIMIZATION ALGORITHM; GLOBAL OPTIMUM; LINEAR PROGRAMMING RELAXATION; LP RELAXATION; MODEL FORMULATION; NETWORK DESIGN; NONCONVEX; OPTIMIZATION MODELS; PARTITIONING STRATEGIES; REFORMULATION-LINEARIZATION TECHNIQUE (RLT); RELIABLE NETWORK DESIGN; TOTAL COSTS; VARIABLE SUBSTITUTION;

DESIGN; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; OPTIMIZATION; PLANNING; RESOURCE ALLOCATION;

GLOBAL OPTIMIZATION;

EID: 69249198221     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.12.016     Document Type: Article

References (24)

1. Andreas A.K., and Smith J.C. Mathematical programming algorithms for two-path routing problems with reliability constraints. Informs Journal on Computing 20 4 (2008) 553-564
2. Andreas A.K., Smith J.C., and Küçükyavuz S. A branch-and-price-and-cut algorithm for solving the reliable h-paths problem. Journal of Global Optimization 42 2 (2008) 443-466
3. Balakrishnan A., Magnanti T.L., and Mirchandani P. A dual-based algorithm for multi-level network design problem. Management Science 40 5 (1994) 567-581
4. Balakrishnan A., Magnanti T.L., and Mirchandani P. Designing hierarchical survivable networks. Operations Research 46 1 (1998) 116-136
5. Balakrishnan A., Magnanti T.L., and Mirchandani P. Intuitive solution-doubling techniques for worst-case analyses of some survivable network design problems. Operations Research Letters 29 (2001) 99-106
6. Balakrishnan A., Magnanti T.L., and Mirchandani P. Connectivity splitting models for survivable network design. Networks 43 (2004) 10-27
7. Chen, A., Kim, J., Zhou, Z., Chootinan, P., 2007. An alpha reliable network design problem. In: Proceedings of the Transportation Research Board Conference, 86th TRB Annual Meeting, Washington, DC, USA.
8. Chootinan P., Wong S.C., and Chen A. A reliability-based network design problem. Journal of Advanced Transportation 39 3 (2005) 247-270
9. Gabow H.N., Goemans M.X., and Williamson D.P. An efficient approximation algorithm for the survivable network design problem. Mathematical Programming 82 (1998) 13-40
10. Gavish B. Topological design of telecommunication networks - Local access design methods. Annals of Operations Research 33 (1991) 17-71
11. Gen M., Kumar A., and Kim J.R. Recent network design techniques using evolutionary algorithms. International Journal of Production Economics 98 2 (2005) 251-261
12. Haggerty J., Shi Q., and Merabti M. Early detection and prevention of denial-of-service attacks: A novel mechanism with propagated traced-back attack blocking. IEEE Journal on Selected Areas in Communications 23 10 (2005) 1994-2002
13. Jia J., and Dyer J.S. A standard measure of risk and risk-value models. Management Science 42 12 (1996) 1691-1705
14. Jorion P. Value at Risk, the New Benchmark for Controlling Market Risk. second ed. (1997), McGraw-Hill, USA
15. Kerivin H., and Mahjoub A.R. Design of survivable networks: A survey. Networks 46 1 (2005) 1-21
16. Liu Y., and Tipper D. Successive survivable routing for node failures. IEEE Global Telecommunications Conference 1 (2001) 2093-2097
17. Marseguerra M., Zio E., Podofillini L., and Coit D.W. Optimal design of reliable network systems in presence of uncertainty. IEEE Transactions on Reliability 54 2 (2005) 243-253
18. Reichelt D., and Rothlauf F. Reliable communication network design with evolutionary algorithms. Computational Intelligence and Applications 5 2 (2005) 251-266
19. Sherali H.D., and Adams W.P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3 3 (1990) 411-430
20. Sherali H.D., and Adams W.P. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Applied Mathematics 52 (1994) 83-106
21. Shulman A., and Vachani R. A decomposition algorithm for capacity expansion of local access networks. IEEE Transactions on Communications 41 7 (1993) 1063-1074
22. Sridhar V., and Park J.S. Benders-and-cut algorithm for fixed-charge capacitated network design problem. European Journal of Operational Research 125 (2000) 622-632
23. Wolsey L.A. Integer Programming (1998), John Wiley & Sons, New York, NY, USA
24. Zabarankin M., Uryasev S., and Pardalos P. Optimal Risk Path Algorithms (2001), Kluwer Academic Publishers, Boston, USA