Network Design with Service Requirements: Scaling-up the Size of Solvable Problems

References

• Andreas AK, Smith JC (2008) Mathematical programming algorithms for two-path routing problems with reliability considerations. INFORMS J. Comput. 20(4):553–564.Link, Google Scholar
• Andreas AK, Smith JC, Küçükyavuz S (2008) Branch-and-price-and-cut algorithms for solving the reliable h-paths problem. J. Global Optim. 42(4):443–466.Crossref, Google Scholar
• Armacost AP, Barnhart C, Ware KA (2002) Composite variable formulations for express shipment service network design. Transportation Sci. 36(1):1–20.Link, Google Scholar
• Balakrishnan A, Altinkemer K (1992) Using a hop-constrained model to generate alternative communication network design. ORSA J. Comput. 4(2):192–205.Link, Google Scholar
• Balakrishnan A, Li G, Mirchandani P (2017) Optimal network design with end-to-end service requirements. Oper. Res. 65(3):729–750.Link, Google Scholar
• Balakrishnan A, Mirchandani P, Natarajan HP (2009) Connectivity upgrade models for survivable network design. Oper. Res. 57(1):170–186.Link, Google Scholar
• Barnhart C, Schneur RR (1996) Air network design for express shipment service. Oper. Res. 44(6):852–863.Link, Google Scholar
• 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.Link, Google Scholar
• Barrera J, Cancela H, Moreno E (2015) Topological optimization of reliable networks under dependent failures. Oper. Res. Lett. 43(2):132–136.Crossref, Google Scholar
• Botton Q, Fortz B, Gouveia L, Poss M (2013) Benders decomposition for the hop-constrained survivable network design problem. INFORMS J. Comput. 25(1):13–26.Link, Google Scholar
• Crainic T (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
• Desrosiers J, Lübbecke ME (2005) A Primer in Column Generation. (Springer US, Boston, MA), 1–32.Crossref, Google Scholar
• Dumitrescu I, Boland N (2003) Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3):135–153.Crossref, Google Scholar
• Gamrath G, Anderson D, Bestuzheva K, Chen W-K, Eifler L, Gasse M, Gemander P, et al. (2020) The SCIP optimization suite 7.0. ZIB report 20-10, Zuse Institute, Berlin.Google Scholar
• Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco).Google Scholar
• Gendron B, Crainic T, Frangioni A (1999) Multicommodity capacitated network design. Sansò B, Soriano P, eds. Telecommunications Network Planning (Springer Science & Business Media, New York), 1–19.Crossref, Google Scholar
• Gouveia L (1998) Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints. INFORMS J. Comput. 10(2):180–188.Link, Google Scholar
• Gouveia L, Leitner M, Ljubić I (2015) The two-level diameter constrained spanning tree problem. Math. Programming 150:49–78.Crossref, Google Scholar
• Grötschel M, Monma CL, Stoer M (1995) Polyhedral and computational investigations for designing communication networks with high survivability requirements. Oper. Res. 43(6):1012–1024.Link, Google Scholar
• Joksch H (1966) The shortest route problem with constraints. J. Math. Anal. Appl. 14:191–197.Crossref, Google Scholar
• Kennington J (1978) A survey of linear cost multicommodity network fows. Oper. Res. 26(2):209–236.Link, Google Scholar
• Kerivin H, Mahjoub AR (2005) Design of survivable networks: A survey. Networks 46(1):1–21.Crossref, Google Scholar
• Kim D, Barnhart C, Ware K, Reinhardt G (1999) Multimodal express package delivery: A service network design application. Transportation Sci. 33(4):391–407.Link, Google Scholar
• Ljubić I, Mutzel P, Zey B (2017) Stochastic survivable network design problems: Theory and practice. Eur. J. Oper. Res. 256(2):333–348.Crossref, Google Scholar
• Magnanti TL, Raghavan S (2005) Strong formulations for network design problems with connectivity requirements. Networks 45(2):61–79.Crossref, Google Scholar
• Magnanti TL, Wong RT (1984) Network design and transportation planning: Models and algorithms. Transportation Sci. 18(1):1–55.Link, Google Scholar
• Mateti P, Deo N (1976) On algorithms for enumerating all circuits of a graph. SIAM J. Comput. 5(1):90–99.Crossref, Google Scholar
• Song Y, Luedtke JR (2013) Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. Math. Programming Comput. 5(4):397–432.Crossref, Google Scholar
• Wieberneit N (2007) Service network design for freight transportation: A review. OR Spectrum 30(1):77–112.Crossref, Google Scholar