An Exact Algorithm for Multilevel Uncapacitated Facility Location

References

• Aardal K, Chudak FA, Shmoys DB (1999) A 3-approximation algorithm for the k-level uncapacitated facility location problem. Inform. Processing Lett. 72(5–6):161–167.Crossref, Google Scholar
• Aardal K, Labbé M, Leung J, Queyranne M (1996) On the two-level uncapacitated facility location problem. INFORMS J. Comput. 8(3):289–301.Link, Google Scholar
• Adulyasak Y, Cordeau JF, Jans R (2015) Benders decomposition for production routing under demand uncertainty. Oper. Res. 63(4):851–867.Link, Google Scholar
• Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ).Google Scholar
• Albareda-Sambola M (2015) Location-routing and location-arc routing. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science (Springer International Publishing, Cham, Switzerland), 399–418.Crossref, Google Scholar
• Barros A, Dekker R, Scholten V (1998) A two-level network for recycling sand: A case study. Eur. J. Oper. Res. 110(2):199–214.Crossref, Google Scholar
• Barros A, Labbé M (1994) A general model for the uncapacitated facility and depot location problem. Location Sci. 2(3):173–191.Google Scholar
• Beasley JE (1990) OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11):1069–1072.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4(1):238–252.Crossref, Google Scholar
• Campbell JF, Ernst A, Krishnamoorthy M (2005) Hub arc location problems part I: Introduction and results. Management Sci. 51(10):1540–1555.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
• Chardaire P, Lutton JL, Sutter A (1999) Upper and lower bounds for the two-level simple plant location problem. Ann. Oper. Res. 86:117–140.Crossref, Google Scholar
• Contreras I (2015) Hub location problems. Laporte G, Saldanha da Gama F, Nickel S, eds. Location Science (Springer International Publishing, Cham, Switzerland), 311–344.Crossref, Google Scholar
• Contreras I, Fernández E (2012) General network design: A unified view of combined location and network design problems. Eur. J. Oper. Res. 219(3):680–697.Crossref, Google Scholar
• Contreras I, Fernández E (2014) Hub location as the minimization of a supermodular set function. Oper. Res. 62(3):557–570.Link, Google Scholar
• Contreras I, Cordeau JF, Laporte G (2011) Benders decomposition for large-scale uncapacitated hub location. Oper. Res. 59(6):1477–1490.Link, Google Scholar
• Contreras I, Fernández E, Reinelt G (2012) Minimizing the maximum travel time in a combined model of facility location and network design. Omega 40(6):847–860.Crossref, Google Scholar
• Cordeau JF, Pasin F, Solomon MM (2006) An integrated model for logistics network design. Ann. Oper. Res. 144(1):59–82.Crossref, Google Scholar
• Cordeau JF, Stojković G, Soumis F, Desrosiers J (2001) Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Sci. 35(4):375–388.Link, Google Scholar
• Cornuéjols G, Fisher ML, Nemhauser GL (1977) Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Sci. 23(8):789–810.Link, Google Scholar
• Edmonds J, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2):248–264.Crossref, Google Scholar
• Errico F, Crainic TG, Malucelli F, Nonato M (2017) A Benders decomposition approach for the symmetric TSP with generalized latency arising in the design of semiflexible transit systems. Transportation Sci. 51(2):706–722.Link, Google Scholar
• Fischetti M, Ljubić I, Sinnl M (2016) Benders decomposition without separability: A computational study for capacitated facility location problems. Eur. J. Oper. Res. 253(3):557–569.Crossref, Google Scholar
• Fischetti M, Ljubić I, Sinnl M (2017) Redesigning benders decomposition for large-scale facility location. Management Sci. 63(7):2146–2162.Link, Google Scholar
• Gabor AF, van Ommeren JKCW (2010) A new approximation algorithm for the multilevel facility location problem. Discrete Appl. Math. 158(5):453–460.Crossref, Google Scholar
• Gendron B, Semet F (2009) Formulations and relaxations for a multi-echelon capacitated location-distribution problem. Comput. Oper. Res. 36(5):1335–1355.Crossref, Google Scholar
• Gendron B, Khuong PV, Semet F (2015) Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment. Networks 66(3):214–234.Crossref, Google Scholar
• Gendron B, Khuong PV, Semet F (2016) A Lagrangian-based branch-and-bound algorithm for the two-level uncapacitated facility location problem with single-assignment constraints. Transportation Sci. 50(4):1286–1299.Link, Google Scholar
• Gendron B, Khuong PV, Semet F (2017) Comparison of formulations for the two-level uncapacitated facility location problem with single-assignment constraints. Comput. Oper. Res. 86(October):86–93.Crossref, Google Scholar
• Geoffrion AM (1974) Multicommodity distribution system design by Benders decomposition. Management Sci. 20(5):822–844.Link, Google Scholar
• Gourdin É, Labbé M, Yaman H (2002) Telecommunication and location. Drezner Z, Hamacher H, eds. Facility Location: Applications and Theory (Springer, Berlin), 275–305.Crossref, Google Scholar
• Greenberg HJ (1987) Diagnosing infeasibility in min-cost network flow problems part I: Dual infeasibility. IMA J. Management Math. 1(2):99–109.Crossref, Google Scholar
• Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3):450–459.Link, Google Scholar
• Kaufman L, Eede M, Hansen P (1977) A plant and warehouse location problem. Oper. Res. Quart. 28(3):547–554.Crossref, Google Scholar
• Kochetov Y, Ivanenko D (2005) Computationally difficult instances for the uncapacitated facility location problem. Ibaraki T, Nonobe K, Yagiura M, eds. Metaheuritics: Progress as Real Problem Solvers, Operations Research/Computer Science Interfaces Series, vol. 32 (Springer, Boston), 351–367.Crossref, Google Scholar
• Kuehn A, Hamburger M (1963) A heuristic program for locating warehouses. Management Sci. 9(4):643–666.Link, Google Scholar
• Landete M, Marín A (2009) New facets for the two-stage uncapacitated facility location polytope. Comput. Optim. Appl. 44(3):487–519.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
• Magnanti TL, Wong RT (1990) Decomposition methods for facility location problems. Mirchandani PB, Francis RL, eds. Discrete Location Theory (Wiley, New York), 209–262.Google Scholar
• Magnanti TL, Mireault P, Wong RT (1986) Tailoring Benders decomposition for uncapacitated network design. Gallo G, Sandi C, eds. Netflow at Pisa (Springer, Berlin), 112–154.Crossref, Google Scholar
• Martins de Sá E, Contreras I, Cordeau JF, Saraiva de Camargo R, de Miranda G (2015) The hub line location problem. Transportation Sci. 49(3):500–518.Link, Google Scholar
• Melkote S, Daskin MS (2001) An integrated model of facility location and transportation network design. Transportation Res. Part A: Policy Practice 35(6):515–538.Crossref, Google Scholar
• Melo MT, Nickel S, Saldanha-da-Gama F (2009) Facility location and supply chain management—A review. Eur. J. Oper. Res. 196(2):401–412.Crossref, Google Scholar
• Memişoğlu G, Üster H (2016) Integrated bioenergy supply chain network planning problem. Transportation Sci. 50(1):35–56.Link, Google Scholar
• Ortiz-Astorquiza C, Contreras I, Laporte G (2017) Formulations and approximation algorithms for multi-level facility location. INFORMS J. Comput. 29(4):767–779.Link, Google Scholar
• Ortiz-Astorquiza C, Contreras I, Laporte G (2018) Multi-level facility location problems. Eur. J. Oper. Res. 267(3):791–805.Crossref, Google Scholar
• Papadakos N (2008) Practical enhancements to the Magnanti–Wong method. Oper. Res. Lett. 36(4):444–449.Crossref, Google Scholar
• Pishvaee MS, Razmi J, Torabi SA (2014) An accelerated Benders decomposition algorithm for sustainable supply chain network design under uncertainty: A case study of medical needle and syringe supply chain. Transportation Res. Part E: Logist. Transportation Rev. 67(July):14–38.Crossref, Google Scholar
• Rahman SU, Smith DK (2000) Use of location-allocation models in health service development planning in developing nations. Eur. J. Oper. Res. 123(3):437–452.Crossref, Google Scholar
• Rahmaniani R, Crainic TG, Gendreau M, Rei W (2017) The benders decomposition algorithm: A literature review. Eur. J. Oper. Res. 259(3):801–817.Crossref, Google Scholar
• Sahin G, Süral H (2007) A review of hierarchical facility location models. Comput. Oper. Res. 34(8):2310–2331.Crossref, Google Scholar
• Zanjirani Farahani R, Hekmatfar M, Fahimnia B, Kazemzadeh N (2014) Hierarchical facility location problem: Models, classifications, techniques, and applications. Comput. Indust. Engrg. 68(February):104–117.Crossref, Google Scholar