Technical note - Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations

Operations Research

Volumn 60, Issue 3, 2012, Pages 604-610

  Lee, Chungmok ^a,b   Lee, Kyungsik ^c   Park, Kyungchul ^d   Park, Sungsoo ^b  

^a Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^c Hankuk University of Foreign Studies   (South Korea)

^d Myong Ji University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-PRICE-AND-CUT; DECOMPOSITION APPROACH; EDGE CAPACITY; LP RELAXATION; NETWORK DESIGN PROBLEMS; ROBUST NETWORK; ROBUST OPTIMIZATION; TECHNICAL NOTES; TRAFFIC DEMANDS; UNDERLYING NETWORKS;

OPERATIONS RESEARCH;

COMPUTER APPLICATIONS;

EID: 84864650151     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1120.1049     Document Type: Article

References (19)

1. Altin A, Yaman H, Pinar MÇ (2011) The robust network loading problem under hose demand uncertainty: Formulation, polyhedral analysis, and computations. INFORMS J. Comput. 23(1):75-89.
2. Altin A, Amaldi E, Belotti P, Pinar MÇ (2007) Provisioning virtual private networks under traffic uncertainty. Networks 49(1):100-115. (Pubitemid 46478320)
3. Atamtürk A, Rajan D (2002) On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math. Programming 92(2): 315-333. (Pubitemid 44744773)
4. Barnhart C, Hane CA, Vance PH (2000) Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Oper. Res. 48(2):318-326.
5. Ben-Tal A, Nemirovski A (2008) Selected topics in robust convex optimization. Math. Programming 112(1):125-158. (Pubitemid 47167327)
6. Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351-376. (Pubitemid 40871727)
7. Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming 98(1-3):49-71.
8. Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1): 35-53. (Pubitemid 40000812)
9. Bertsimas D, Weismantel R (2005) Optimization Over Integers (Dynamic Ideas, Charlestown, MA).
10. Klopfenstein O, Nace D (2009) Valid inequalities for a robust knapsack polyhedron-application to the robust bandwidth packing problem. Proc. Internat. Network Optim. Conf. INOC 2009.
11. Koster AMCA, Kutschka M, Raack C (2010) Towards robust network design using integer linear programming techniques. 6th EURO-NF Conf. Next Generation Internet 4NGI5.
12. Martello S, Toth P (1990) Knapsack Problems: Algorithms and Computer Implementations (John Wiley & Sons, Hoboken, NJ).
13. Mattia S (2010) The robust network loading problem with dynamic routing. Technical Report 3, Università di Roma la Sapienza, Rome.
14. Mudchanatongsuk S, Ordonez F, Liu J (2008) Robust solutions for network design under transportation cost and demand uncertainty. J. Oper. Res. Soc. 59(5):652-662. (Pubitemid 351598876)
15. Orlowski S, Wessäly R, Pióro M, Tomaszewski A (2010) SNDlib 1.0- Survivable Network Design Library. Networks 55(3):276-286.
16. Park S, Kim D, Lee K (2003) An integer programming approach to the path selection problems. Proc. Internat. Network Optim. Conf. INOC 2003.
17. Raack C, Koster AMCA, Orlowski S, Wessäly R (2011) On cut-based inequalities for capacitated network design polyhedra. Networks 57(2):141-156.
18. Stallings W (1998) High-Speed Networks: TCP/IP and ATM Design Principles (Prentice Hall, Englewood Cliffs, NJ).
19. Xiao XP, Hannan A, Bailey B, Ni LM (2000) Traffic engineering with MPLS in the Internet. IEEE Network 14(2):28-33. (Pubitemid 30584025)