Optimal Network Design with End-to-End Service Requirements

References

• Ahuja RK, Orlin JB, Magnanti TL (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Andersen J, Crainic TG, Christiansen M (2009a) Service network design with management and coordination of multiple fleets. Eur. J. Oper. Res. 193(2):377–389.Crossref, Google Scholar
• Andersen J, Crainic TG, Christiansen M (2009b) Service network design with asset management: Formulations and comparative analyses. Transportation Res. Part C 17:197–207.Crossref, Google Scholar
• 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
• Atamturk A (2004) Polyhedral methods in discrete optimization. Hosten S, Lee J, Thomas R, eds. Trends Optim. Proc. Symposia Appl. Math. Vol. 61 (AMS, Providence, RI), 21–37.Crossref, Google Scholar
• Atamturk A, Nemhauser GL, Savelsbergh MWP (2000) Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121(1):40–55.Crossref, Google Scholar
• Balakrishnan A, Altinkemer K (1992) Using a hop-constrained model to generate alternative communication network designs. INFORMS J. Comput. 4(2):192–205.Link, Google Scholar
• Balakrishnan A, Graves SC (1989) A composite algorithm for a concave-cost network flow problem. Networks 19(2):175–202.Crossref, Google Scholar
• Balakrishnan A, Magnanti TL, Mirchandani P (1997) Network design. DellAmico M, Maffioli F, Martello S, eds. Annotated Bibliographies in Combinatorial Optimization (John Wiley & Sons, New York), 311–334.Google Scholar
• Balakrishnan A, Magnanti TL, Wong RT (1989) A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. 37(5):716–740.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
• Beasley JE, Christofides N (1989) An algorithm for the resource constrained shortest path problem. Networks 19(4):379–394.Crossref, Google Scholar
• Berman P, Bhattacharyya A, Makarychev K, Raskhodnikova S, Yaroslavtsev G (2011) Improved approximation for the directed spanner problem. Automata, Languages and Programming (Springer, Berlin), 1–12.Crossref, Google Scholar
• Chouman M, Crainic TG, Gendron B (2016) Commodity representations and cut-set-based inequalities for multicommodity capacitated fixed-charge network design. Transportation Sci., ePub ahead of print July 27, https://doi.org/10.1287/trsc.2015.0665.Link, Google Scholar
• Costa AM, Cordeau J-F, Laporte G (2008) Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. Eur. J. Oper. Res. 190(1):68–78.Crossref, Google Scholar
• Costa AM, Cordeau J-F, Laporte G (2009) Models and branch-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints. Networks 53(2):141–159.Crossref, Google Scholar
• Crainic T (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272–288.Crossref, Google Scholar
• Dahl G, Gouveia L (2004) On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32:15–22.Crossref, Google Scholar
• Dahl G, Gouveia L, Requejo C (2006) On formulations and methods for the hop-constrained minimum spanning tree problem. Resende MGC, Pardalos PM, eds. Handbook of Optimization in Telecommunications (Springer, New York), 493–515.Crossref, Google Scholar
• Elkin M, Peleg D (2007) The hardness of approximating spanner problems. Theory Comput. Systems 41(4):691–729.Crossref, Google Scholar
• Elkin M, Zhang J (2006) Efficient algorithms for constructing (1 + epsilon, beta)-spanners in the distributed and streaming models. Distributed Comput. 18(5):375–385.Crossref, Google Scholar
• Gouveia L, Magnanti TL (2003) Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41(3):159–173.Crossref, Google Scholar
• Gouveia L, Leitner M, Ljubic I (2015) The two-level diameter constrained spanning tree problem. Math. Programming 150(1):49–78.Crossref, Google Scholar
• Grandoni F, Ravi R, Singh M, Zenklusen R (2014) New approaches to multi-objective optimization. Math. Programming 146(1):525–554.Crossref, Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MW (1999) Lifted cover inequalities for 0-1 integer programs: Complexity. INFORMS J. Comput. 11(1):117–123.Link, 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
• Handler G, Zang I (1980) A dual algorithm for the constrained shortest path problem. Networks 10(4):293–310.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
• Magnanti TL, Mirchandani P, Vachani R (1995) Modeling and solving the two-facility capacitated network loading problem. Oper. Res. 43(1):142–157.Link, Google Scholar
• Marathe MV, Ravi R, Sundaram R, Rosenkrantz DJ, Hunt HB III (1998) Bicriteria network design problems. J. Algorithms 28(1): 142–171.Crossref, Google Scholar
• Minoux M (1989) Network synthesis and optimum network design problems: Models, solution methods and applications. Networks 19(3):313–360.Crossref, Google Scholar
• Narasimhan G, Smid M (2007) Geometric Spanner Networks (Cambridge University Press, New York).Crossref, Google Scholar
• Nemhauser G, Wolsey LA (1999) Integer and Combinatorial Optimization (John Wiley & Sons, New York).Google Scholar
• Peleg D, Schäffer A (1989) Graph spanners. J. Graph Theory 13(1):99–116.Crossref, Google Scholar
• Rajan D, Atamturk A (2004) A directed cycle-based column-and-cut generation method for capacitated survivable network design. Networks 43(4):201–211.Crossref, Google Scholar
• Ravi R, Goemans M (1996) The constrained minimum spanning tree problem. Karlsson RG, Lingas A, eds. Proc. 5th Scandinavian Workshop on Algorithm Theory—Algorithm Theory, SWAT ’96 (Springer, Berlin), 66–75.Crossref, Google Scholar
• Resende MGC, Pardalos PM, eds. (2006) Handbook of Optimization in Telecommunications (Springer, New York).Crossref, Google Scholar
• Rosenwein MB, Wong RT (1995) A constrained Steiner tree problem. Eur. J. Oper. Res. 81(2):430–439.Crossref, Google Scholar
• Song Y, Luedtke JR (2013) Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. Math. Programming Computations 5(4):397–432.Crossref, Google Scholar
• Voss S (2006) Steiner tree problems in telecommunications. Resende MGC, Pardalos PM, eds. Handbook of Optimization in Telecommunications (Springer, New York), 459–492.Crossref, Google Scholar