Continuous Facility Location with Backbone Network Costs

References

• Arnold P, Peeters D, Thomas I (2004) Modelling a rail/road intermodal transportation system. Transportation Res. Part E 40(3): 255–270.Crossref, Google Scholar
• Beardwood J, Halton JH, Hammersley JM (1959) The shortest path through many points. Math. Proc. Cambridge Philos. Soc. 55(4): 299–327.Crossref, Google Scholar
• Bergeijk PAG, Brakman S (2010) The Gravity Model in International Trade: Advances and Applications (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Berman O, Jaillet P, Simchi-Levi D (1995) Location-routing problems with uncertainty. Drezner Z, ed. Facility Location: A Survey of Applications and Methods (Springer-Verlag, Berlin), 427–452.Crossref, Google Scholar
• Bertsimas DJ, Simchi-Levi D (1996) A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. 44(2):286–304.Link, Google Scholar
• Cachon GP (2014) Retail store density and the cost of greenhouse gas emissions. Management Sci. 60(8):1907–1925.Link, Google Scholar
• Campbell JF (1990) Designing logistics systems by analyzing transportation, inventory and terminal cost tradeoffs. J. Bus. Logist. 11(1):159–179.Google Scholar
• Campbell JF (1993) One-to-many distribution with transshipments: An analytic model. Transportation Sci. 27(4):330–340.Link, Google Scholar
• Campbell JF, Nickerson JV (2011) Optimal arrangements for assembling a network in an emergency. Hawaii Internat. Conf. System Sci. (Institute of Electrical and Electronics Engineers, Washington, DC), 1–10.Crossref, Google Scholar
• Carlsson JG, Jia F, Li Y (2014) An approximation algorithm for the continuous k-medians problem in a convex polygon. INFORMS J. Comput. 26(2):280–289.Link, Google Scholar
• Daganzo CF (1984) The length of tours in zones of different shapes. Transportation Res. Part B 18(2):135–145.Crossref, Google Scholar
• Daganzo CF, Newell GF (1986) Configuration of physical distribution networks. Networks 16(2):113–132.Crossref, Google Scholar
• Drezner Z, Zemel E (1993) Competitive location in the plane. Ann. Oper. Res. 40(1):173–193.Crossref, Google Scholar
• Few L (1955) The shortest path and the shortest road through n points. Mathematika 2(2):141–144.Crossref, Google Scholar
• Geoffrion AM (1979) Making better use of optimization capability in distribution system planning. AIIE Trans. 11(2):96–108.Crossref, Google Scholar
• Grünbaum B, Shephard GC (2012) Tilings and Patterns, Dover Books on Mathematics Series (Dover Publications, Mineola, NY).Google Scholar
• Haimovich M, Rinnooy Kan AHG (1985) Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10(4):527–542.Link, Google Scholar
• Hochbaum DS (1984) When are NP-hard location problems easy? Ann. Oper. Res. 1(3):201–214.Crossref, Google Scholar
• Langevin A, Mbaraga P, Campbell JF (1996) Continuous approximation models in freight distribution: An overview. Transportation Res. Part B 30(3):163–188.Crossref, Google Scholar
• Li S (2011) A 1.488 approximation algorithm for the uncapacitated facility location problem. Proc. 38th Internat. Conf. Automata,Languages and Programming—Volume Part II, ICALP'11 (Springer-Verlag, Berlin), 77–88.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
• Melkote S, Daskin MS (2001) An integrated model of facility location and transportation network design. Transportation Res. Part A 35(6):515–538.Google Scholar
• Miranda PA, Garrido RA (2004) Incorporating inventory control decisions into a strategic distribution network design model with stochastic demand. Transportation Res. Part E 40(3): 183–207.Crossref, Google Scholar
• Nagy G, Salhi S (2007) Location-routing: Issues, models and methods. Eur. J. Oper. Res. 177(2):649–672.Crossref, Google Scholar
• Newell GF (1973) Scheduling, location, transportation, and continuum mechanics; some simple approximations to optimization problems. SIAM J. Appl. Math. 25(3):346–360.Crossref, Google Scholar
• Newell GF, Daganzo CF (1986) Design of multiple-vehicle delivery tours–I a ring-radial network. Transportation Res. Part B 20(5):345–363.Crossref, Google Scholar
• Pinedo M (2008) Scheduling: Theory, Algorithms, and Systems (Springer, New York).Google Scholar
• Redmond C, Yukich JE (1994) Limit theorems and rates of convergence for Euclidean functionals. Ann. Appl. Probab. 4(4): 1057–1073.Crossref, Google Scholar
• Rodrigue JP, Comtois C, Slack B (2009) The Geography of Transport Systems (Routledge, New York).Google Scholar
• Sheppard E (1978) Theoretical underpinnings of the gravity hypothesis. Geographical Anal. 10(4):386–402.Crossref, Google Scholar
• Steele JM (1981) Subadditive Euclidean functionals and nonlinear growth in geometric probability. Ann. Probab. 9(3):365–376.Crossref, Google Scholar
• Zemel E (1984) Probabilistic analysis of geometric location problems. Ann. Oper. Res. 1(3):215–238.Crossref, Google Scholar