Single Allocation Hub Location with Heterogeneous Economies of Scale

References

• Alumur SA, Kara BY (2008) Network hub location problems: The state of the art. Eur. J. Oper. Res. 190(1):1–21.Crossref, Google Scholar
• Alumur SA, Campbell JF, Contreras I, Kara BY, Marianov V, O’Kelly ME (2021) Perspectives on modeling hub location problems. Eur. J. Oper. Res. 291(1):1–17.Crossref, Google Scholar
• Angulo G, Ahmed S, Dey SS (2016) Improving the integer L-shaped method. INFORMS J. Comput. 28(3):483–499.Link, Google Scholar
• Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2):387–405.Crossref, Google Scholar
• Campbell JF (1996) Hub location and the p-hub median problem. Oper. Res. 44(6):923–935.Link, Google Scholar
• Campbell JF, O’Kelly ME (2012) Twenty-five years of hub location research. Transportation Sci. 46(2):153–169.Link, Google Scholar
• Campbell JF, Ernst AT, Krishnamoorthy M (2005) Hub arc location problems: Part I: Introduction and results. Management Sci. 51(10):1540–1555.Link, Google Scholar
• Carello G, Della Croce F, Ghirardi M, Tadei R (2004) Solving the hub location problem in telecommunication network design: A local search approach. Networks 44(2):94–105.Crossref, Google Scholar
• Çetiner S, Sepil C, Süral H (2010) Hubbing and routing in postal delivery systems. Ann. Oper. Res. 181(1):109–124.Crossref, Google Scholar
• Contreras I, O’Kelly M (2019) Hub location problems. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science (Springer International Publishing, Cham, Switzerland), 327–363.Crossref, Google Scholar
• Contreras I, Cordeau J-F, Laporte G (2011a) Benders decomposition for large-scale uncapacitated hub location. Oper. Res. 59(6):1477–1490.Link, Google Scholar
• Contreras I, Cordeau J-F, Laporte G (2011b) Stochastic uncapacitated hub location. Eur. J. Oper. Res. 212(3):518–528.Crossref, Google Scholar
• Contreras I, Cordeau J-F, Laporte G (2012) Exact solution of large-scale hub location problems with multiple capacity levels. Transportation Sci. 46(4):439–459.Link, Google Scholar
• Contreras I, Díaz JA, Fernández E (2011c) Branch and price for large-scale capacitated hub location problems with single assignment. INFORMS J. Comput. 23(1):41–55.Link, Google Scholar
• Correia I, Nickel S, Saldanha-da-Gama F (2010a) The capacitated single-allocation hub location problem revisited: A note on a classical formulation. Eur. J. Oper. Res. 207(1):92–96.Crossref, Google Scholar
• Correia I, Nickel S, Saldanha-da-Gama F (2010b) Single-assignment hub location problems with multiple capacity levels. Transportation Res. Part B: Methodological 44(8):1047–1066.Crossref, Google Scholar
• Croxton KL, Gendron B, Magnanti TL (2003a) A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Sci. 49(9):1268–1273.Link, Google Scholar
• Croxton KL, Gendron B, Magnanti TL (2003b) Models and methods for merge-in-transit operations. Transportation Sci. 37(1):1–22.Link, Google Scholar
• Croxton KL, Gendron B, Magnanti TL (2007) Variable disaggregation in network flow problems with piecewise linear costs. Oper. Res. 55(1):146–157.Link, Google Scholar
• Cunha CB, Silva MR (2007) A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil. Eur. J. Oper. Res. 179(3):747–758.Crossref, Google Scholar
• de Camargo RS, de Miranda G Jr, Luna HPL (2009) Benders decomposition for hub location problems with economies of scale. Transportation Sci. 43(1):86–97.Link, Google Scholar
• Dukkanci O, Kara BY (2017) Routing and scheduling decisions in the hierarchical hub location problem. Comput. Oper. Res. 85:45–57.Crossref, Google Scholar
• Eiselt HA, Marianov V (2009) A conditional p-hub location problem with attraction functions. Comput. Oper. Res. 36(12):3128–3135.Crossref, Google Scholar
• Elhedhli S, Hu FX (2005) Hub-and-spoke network design with congestion. Comput. Oper. Res. 32(6):1615–1632.Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Sci. 4(3):139–154.Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M (1998) Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem. Eur. J. Oper. Res. 104(1):100–112.Crossref, Google Scholar
• Ernst AT, Krishnamoorthy M (1999) Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86:141–159.Crossref, Google Scholar
• Fisher ML (2004) The Lagrangian relaxation method for solving integer programming problems. Management Sci. 50(12 suppl):1861–1871.Link, Google Scholar
• Frangioni A, Gendron B (2009) 0–1 reformulations of the multicommodity capacitated network design problem. Discrete Appl. Math. 157(6):1229–1241.Crossref, Google Scholar
• Gelareh S, Pisinger D (2011) Fleet deployment, network design and hub location of liner shipping companies. Transportation Res., Part E Logist. Transportation Rev. 47(6):947–964.Crossref, Google Scholar
• Guzelsoy M, Ralphs TK (2007) Duality for mixed-integer linear programs. Internat. J. Oper. Res. (Taichung) 4(3):118–137.Google Scholar
• Imai A, Shintani K, Papadimitriou S (2009) Multi-port vs. hub-and-spoke port calls by containerships. Transportation Res., Part E Logist. Transportation Rev. 45(5):740–757.Crossref, Google Scholar
• Jaillet P, Song G, Yu G (1996) Airline network design and hub location problems. Location Sci. 4(3):195–212.Crossref, Google Scholar
• Kara BY, Tansel BC (2001) The latest arrival hub location problem. Management Sci. 47(10):1408–1420.Link, Google Scholar
• Kelley JE (1960) The cutting-plane method for solving convex programs. J. Soc. Industrial Appl. Math. 8(4):703–712.Crossref, Google Scholar
• Klincewicz JG (1998) Hub location in backbone/tributary network design: a review. Location Sci. 6(1):307–335.Crossref, Google Scholar
• Klincewicz JG (2002) Enumeration and search procedures for a hub location problem with economies of scale. Ann. Oper. Res. 110(1-4):107–122.Crossref, Google Scholar
• Labbé M, Yaman H (2004) Projecting the flow variables for hub location problems. Networks 44(2):84–93.Crossref, Google Scholar
• Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.Crossref, Google Scholar
• Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464–484.Link, Google Scholar
• Mahéo A, Kilby P, Van Hentenryck P (2019) Benders decomposition for the design of a hub and shuttle public transit system. Transportation Sci. 53(1):77–88.Link, Google Scholar
• Meier JF, Clausen U (2018) Solving single allocation hub location problems on Euclidean data. Transportation Sci. 52(5):1141–1155.Link, Google Scholar
• Nickel S, Schöbel A, Sonneborn T (2001) Hub location problems in urban traffic networks. Pursula M, Niittymäki J, eds. Mathematical Methods on Optimization in Transportation Systems (Springer, Boston), 95–107.Crossref, Google Scholar
• O’Kelly ME (1987) A quadratic integer program for the location of interacting hub facilities. Eur. J. Oper. Res. 32(3):393–404.Crossref, Google Scholar
• O’Kelly ME, Bryan D (1998) Hub location with flow economies of scale. Transportation Res. Part B: Methodological 32(8):605–616.Crossref, Google Scholar
• Podnar H, Skorin-Kapov J, Skorin-Kapov D (2002) Network cost minimization using threshold-based discounting. Eur. J. Oper. Res. 137(2):371–386.Crossref, Google Scholar
• Ralphs TK, Hassanzadeh A (2014) A generalization of Benders’ algorithm for two-stage stochastic optimization problems with mixed integer recourse. Technical report 14T-005, Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA.Google Scholar
• Rostami B, Kämmerling N, Buchheim C, Clausen U (2018) Reliable single allocation hub location problem under hub breakdowns. Comput. Oper. Res. 96:15–29.Crossref, Google Scholar
• Rostami B, Meier J, Buchheim C, Clausen U (2015) The Uncapacitated Single Allocation p-Hub Median Problem with Stepwise Cost Function (Optimization Online).Google Scholar
• Rostami B, Kämmerling N, Naoum-Sawaya J, Buchheim C, Clausen U (2021) Stochastic single-allocation hub location. Eur. J. Oper. Res. 289(3):1087–1106.Crossref, Google Scholar
• Skorin-Kapov D, Skorin-Kapov J, O’Kelly M (1996) Tight linear programming relaxations of uncapacitated p-hub median problems. Eur. J. Oper. Res. 94(3):582–593.Crossref, Google Scholar
• Tanash M, Contreras I, Vidyarthi N (2017) An exact algorithm for the modular hub location problem with single assignments. Comput. Oper. Res. 85:32–44.Crossref, Google Scholar
• Vielma JP, Ahmed S, Nemhauser G (2010) Mixed-integer models for nonseparable piecewise-linear optimization: Unifying framework and extensions. Oper. Res. 58(2):303–315.Link, Google Scholar
• Wolsey LA (1981) Integer programming duality: Price functions and sensitivity analysis. Math. Programming 20(1):173–195.Crossref, Google Scholar
• Yaman H, Karasan OE, Kara BY (2012) Release time scheduling and hub location for next-day delivery. Oper. Res. 60(4):906–917.Link, Google Scholar