The Recoverable Robust Two-Level Network Design Problem

References

• Atamtürk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55:662–673.Link, Google Scholar
• Balakrishnan A, Magnanti T, Mirchandani P (1994a) A dual-based algorithm for multi-level network design. Management Sci. 40:567–581.Link, Google Scholar
• Balakrishnan A, Magnanti TL, Mirchandani P (1994b) Modeling and heuristic worst-case performance analysis of the two-level network design problem. Management Sci. 40:846–867.Link, Google Scholar
• Barabasi A, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512.Crossref, Google Scholar
• Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math. Programming, Ser. B 88:411–421.Crossref, Google Scholar
• Ben-Tal A, El-Ghaoui L, Nemirovski A, eds. (2010) Robust Optimization, 1st ed. (Princeton University Press, Princeton, NJ).Google Scholar
• Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming, Ser. A 99:351–376.Crossref, Google Scholar
• Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming, Ser. B 98:49–71.Crossref, Google Scholar
• Birge J, Louveaux F (2011) Introduction to Stochastic Programming, 2nd ed. (Springer, New York).Crossref, Google Scholar
• Büsing C (2012) Recoverable robust shortest path problems. Networks 59:181–189.Crossref, Google Scholar
• Büsing C, Koster A, Kutschka M (2011) Recoverable robust knapsacks: The discrete scenario case. Optim. Lett. 5:379–392.Crossref, Google Scholar
• Chamberland S (2010) On the design problem of two-level IP networks. Pióro M, Szcpiorski K, Rak J, Gonzalez-Soto O, eds. Proc. IEEE 14th Sympos. Internat. Telecomm. Network Strategy and Planning (IEEE, Piscataway, NJ), 1–6.Crossref, Google Scholar
• Cherkassky B, Goldberg A (1995) On implementing push-relabel method for the maximum flow problem. Balas E, Clausen J, eds. Proc. IPCO IV, LNCS, Vol. 920 (Springer, Berlin),157–171.Crossref, Google Scholar
• Chopra S, Tsai C (2002) A branch-and-cut approach for minimum cost multi-level network design. Discrete Math. 242:65–92.Crossref, Google Scholar
• Cicerone S, Di Stefano G, Schachtebeck M, Schöbel A (2012) Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. Inform. Sci. 190:107–126.Crossref, Google Scholar
• Costa A, França P, Lyra C (2011) Two-level network design with intermediate facilities: An application to electrical distribution systems. Omega 39:3–13.Crossref, Google Scholar
• Current JR (1988) The design of a hierarchical transportation network with transshipment facilities. Transportation Sci. 22:270–277.Link, Google Scholar
• Current J, ReVelle C, Cohon J (1986) The hierarchical network design problem. Eur. J. Oper. Res. 27:57–66.Crossref, Google Scholar
• Duin C, Volgenant A (1989) Reducing the hierarchical network design problem. Eur. J. Oper. Res. 39:332–344.Crossref, Google Scholar
• Duin C, Volgenant T (1991) The multi-weighted Steiner tree problem. Ann. Oper. Res. 33:451–469.Crossref, Google Scholar
• Garg N, Vazirani V, Yannakakis M (1997) Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18:3–20.Crossref, Google Scholar
• Gollowitzer S, Gouveia L, Ljubić I (2013) Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. Eur. J. Oper. Res. 225:211–222.Crossref, Google Scholar
• Gouveia L, Telhada J (2008) The multi-weighted Steiner tree problem: A reformulation by intersection. Comput. OR 35:3599–3611.Crossref, Google Scholar
• Grötschel M, Monma C, Stoer M (1992) Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM J. Optim. 2:474–504.Crossref, Google Scholar
• igraph Project, The (2012) The igraph library for complex network research. Software, http://igraph.sourceforge.net/.Google Scholar
• Johnson D, Minkoff M, Phillips S (2000) The prize collecting Steiner tree problem: Theory and practice. Shmoys D, ed. Proc. 11th Sympos. Discrete Algorithms (SIAM, Philadelphia), 760–769.Google Scholar
• Kouvelis P, Yu G, eds. (1997) Robust Discrete Optimization and Its Applications, 1st ed. (Kluwer Academic Publishers, Dordrecht, the Netherlands).Crossref, Google Scholar
• Liebchen C, Lübbecke M, Möhring R, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. Ahuja R, Möhring R, Zaroliagis C, eds. Robust and Online Large-Scale Optimization, LNCS, Vol. 5868 (Springer, Berlin), 1–27.Crossref, Google Scholar
• Ljubić I, Weiskircher R, Pferschy U, Klau G, Mutzel P, Fischetti M (2006) An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math. Programming, Ser. B 105:427–449.Crossref, Google Scholar
• Mirchandani P (1996) The multi-tier tree problem. INFORMS J. Comput. 8:202–218.Link, Google Scholar
• Obreque C, Donoso M, Gutiérrez G, Marianov V (2010) A branch and cut algorithm for the hierarchical network design problem. Eur. J. Oper. Res. 200:28–35.Crossref, Google Scholar
• Pirkul H, Current J, Nagarajan V (1991) The hierarchical network design problem: A new formulation and solution procedures. Transportation Sci. 25:175–182.Link, Google Scholar
• Sancho N (1995) A suboptimal solution to a hierarchial network design problem using dynamic programming. Eur. J. Oper. Res. 83:237–244.Crossref, Google Scholar
• Thiele A, Terry T, Epelman M (2009) Robust linear optimization with recourse. Technical Report TR09-01, University of Michigan, Ann Arbor.Google Scholar
• yWorks (2012) yEd Graph Editor. Software, http://www.yworks.com/.Google Scholar
• Zhao L, Zeng B (2012) An exact algorithm for two-stage robust optimization with mixed integer recourse problems. Technical Report, University of South Florida, Tampa.Google Scholar