Robust Network Design with Uncertain Outsourcing Cost

References

• Agiakloglou C, Yannelis D (2006) Estimation of price elasticities for international telecommunications demand. Internat. Adv. Econom. Res. 12(1):131–137.Crossref, Google Scholar
• 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.Link, Google Scholar
• Andrade R, Lisser A, Maculan N, Plateau G (2006) Enhancing a branch-and-bound algorithm for two-stage stochastic integer network design-based models. Management Sci. 52(9): 1450–1455.Link, Google Scholar
• Babonneau F, Klopfenstein O, Ouorou A, Vial J-P (2013) Robust capacity expansion solutions for telecommunication networks with uncertain demands. Networks 62(4):255–272.Crossref, Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski AS (2009) Robust Optimization (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Ben-Tal A, Nemirovski A, Roos C (2002) Robust solutions of uncertain quadratic and conic-quadratic problems. SIAM J. Optim. 13(2):535–560.Crossref, Google Scholar
• Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming 99(2):351–376.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1): 35–53.Link, Google Scholar
• Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Crossref, Google Scholar
• Bertsimas D, Dunning I, Lubin M (2015) Reformulations versus cutting planes for robust optimization: A computational and machine learning perspective. Comput. Management Sci. Forthcoming.Google Scholar
• Borchers B (1999) CSDP 2.3 user’s guide. Optim. Methods Software 11(1–4):597–611.Crossref, Google Scholar
• CPLEX (2013) IBM ILOG CPLEX 12.4 Reference Manual (ILOG CPLEX Division, Gentilly, France).Google Scholar
• Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math. Programming 91(2):201–213.Crossref, Google Scholar
• Fischetti M, Monaci M (2012) Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Programming Comput. 4(3):239–273.Crossref, Google Scholar
• Garbacz C, Thompson HG Jr (2007) Demand for telecommunication services in developing countries. Telecomm. Policy 315:276–289.Crossref, Google Scholar
• Garstka SJ (1973) Stochastic programs with recourse: Random recourse costs only. Management Sci. 19(7):747–762.Link, Google Scholar
• Grötschel M, Lovász L, Schrijver A (1993) Geometric Algorithms and Combinatorial Optimization (Springer, Berlin).Crossref, Google Scholar
• Kelley JE Jr (1960) The cutting-plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8(4):703–712.Crossref, Google Scholar
• Koster AMCA, Kutschka M, Raack C (2013) Robust network design: Formulations, valid inequalities, and computations. Networks 61(2):128–149.Crossref, Google Scholar
• Kreinovich V, Neumaier A, Xiang G (2008) Towards a combination of interval and ellipsoid uncertainty. Comput. Technologies 13(6):5–16.Google Scholar
• Lee C, Lee K, Park K, Park S (2012) Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations. Oper. Res. 60(3):604–610.Link, Google Scholar
• Lemaréchal C, Ouorou A, Petrou G (2010) Robust network design in telecommunications under polytope demand uncertainty. Eur. J. Oper. Res. 206(3):634–641.Crossref, Google Scholar
• Matsui T (1996) Np-hardness of linear multiplicative programming and related problems. J. Global Optim. 9(2):113–119.Crossref, Google Scholar
• Mattia S (2013) The robust network loading problem with dynamic routing. Comput. Optim. Appl. 54(3):619–643.Crossref, Google Scholar
• Monaci M, Pferschy U, Serafini P (2013) Exact solution of the robust knapsack problem. Comput. Oper. Res. 40(11):2625–2631.Crossref, Google Scholar
• Orlowski S, Pióro M, Tomaszewski A, Wessäly R (2010) SNDlib 1.0–Survivable network design library. Networks 55(3):276–286.Crossref, Google Scholar
• Ouorou A (2013) Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty. Comput. Oper. Res. 40(1):318–327.Crossref, Google Scholar
• Ouorou A, Vial J-P (2007) A model for robust capacity planning for telecommunications networks under demand uncertainty. 6th Internat. Workshop Design Reliable Comm. Networks (Design of Reliable Communication Networks, Paris), 1–4.Crossref, Google Scholar
• Ouorou A, Mahey P, Vial J-Ph (2000) A survey of algorithms for convex multicommodity flow problems. Management Sci. 46(1): 126–147.Link, Google Scholar
• Pólik I, Terlaky T (2007) A survey of the s-lemma. SIAM Rev. 49(3): 371–418.Crossref, Google Scholar
• Poss M (2013) Robust combinatorial optimization with variable budgeted uncertainty. 4OR 11(1):75–92.Crossref, Google Scholar
• Poss M (2014a) A comparison of routing sets for robust network design. Optim. Lett. 8(5):1619–1635.Crossref, Google Scholar
• Poss M (2014b) Robust combinatorial optimization with variable cost uncertainty. Eur. J. Oper. Res. 237(3):836–845.Crossref, Google Scholar
• Poss M, Raack C (2013) Affine recourse for the robust network design problem: Between static and dynamic routing. Networks 61(2):180–198.Crossref, Google Scholar
• Sen S, Doverspike RD, Cosares S (1994) Network planning with random demand. Telecomm. Systems 3(1):11–30.Crossref, Google Scholar