A New Heuristic Formulation for a Competitive Maximal Covering Location Problem

References

• Alekseeva E, Kochetov Y (2013) Matheuristics and exact methods for the discrete (r|p)-centroid problem. Talbi EG, ed. Metaheuristics for Bi-Level Optimization (Springer, Berlin Heidelberg), 189–219.Google Scholar
• Bard JF (2009) Bilevel programming in management. Floudas CA, Pardalos PM, eds. Encyclopedia of Optimization (Springer, New York), 269–274.Crossref, Google Scholar
• Bard JF, Moore JT (1992) An algorithm for the discrete bilevel programming problem. Naval Res. Logist. 39(3):419–435.Crossref, Google Scholar
• Biesinger B, Hu B, Raidl G (2016) Models and algorithms for competitive facility location problems with different customer behavior. Ann. Math. Artificial Intelligence 76(1):93–119.Crossref, Google Scholar
• Campos Rodríguez CM, Santos Peñate DR, Moreno Pérez JA (2010) An exact procedure and LP formulations for the leader-follower location problem. TOP 18(1):97–121.Crossref, Google Scholar
• Church R, ReVelle CS (1974) The maximal covering location problem. Papers Regional Sci. 32(1):101–118.Crossref, Google Scholar
• Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann. Oper. Res. 153(1):235–256.Crossref, 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
• Daskin MS (2013) Network and Discrete Location: Models, Algorithms, and Applications, Second ed. (Wiley, New York).Crossref, Google Scholar
• Davydov IA, Kochetov YA, Mladenovic N, Urosevic D (2014) Fast metaheuristics for the discrete (r|p)-centroid problem. Automation Remote Control 75(4):677–687.Google Scholar
• DeNegre ST, Ralphs TK (2009) A branch-and-cut algorithm for integer bilevel linear programs. Chinneck JW, Kristjansson B, Saltzman MJ, eds. Operations Research and Cyber-Infrastructure, Oper. Res./Comput. Sci. Interfaces, Vol. 47 (Springer, Boston), 65–78.Crossref, Google Scholar
• Drezner Z, ed. (1995) Facility Location: A Survey of Applications and Methods (Springer-Verlag, New York).Crossref, Google Scholar
• Drezner Z, Hamacher HW, eds. (2002) Facility Location: Applications and Theory (Springer-Verlag, New York).Crossref, Google Scholar
• Eiselt HA, Laporte G (1996) Sequential location problems. Eur. J. Oper. Res. 96(2):217–231.Crossref, Google Scholar
• Hakimi SL (1983) On locating new facilities in a competitive environment. Eur. J. Oper. Res. 12(1):29–35.Crossref, Google Scholar
• Hochbaum DS (1997) Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems. Hochbaum DS, ed. Approximation Algorithms for NP-Hard Problems (PWS Publishing Company, Boston), 94–143.Google Scholar
• Hotelling H (1929) Stability in competition. Econom. J. 39(153):41–57.Google Scholar
• Jeroslow RG (1985) The polynomial hierarchy and a simple model for competitive analysis. Math. Programming 32(2):146–164.Crossref, Google Scholar
• Kress D, Pesch E (2012) Sequential competitive location on networks. Eur. J. Oper. Res. 217(3):483–499.Crossref, Google Scholar
• Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Management Sci. 9(4):643–666.Link, Google Scholar
• Megiddo N, Zemel E, Hakimi SL (1983) The maximum coverage location problem. SIAM J. Algebraic Discrete Methods 4(2):253–261.Crossref, Google Scholar
• Moore JT, Bard JF (1990) The mixed integer linear bilevel programming problem. Oper. Res. 38(5):911–921.Link, Google Scholar
• Plastria F, Vanhaverbeke L (2008) Discrete models for competitive location with foresight. Comput. Oper. Res. 35(3):683–700.Crossref, Google Scholar
• ReVelle CS (1986) The maximum capture or “sphere of influence” location problem: Hotelling revisited on a network. J. Regional Sci. 26(2):343–358.Crossref, Google Scholar
• Roboredo MC, Pessoa AA (2013) A branch-and-cut algorithm for the discrete (r|p)-centroid problem. Eur. J. Oper. Res. 224(1):101–109.Crossref, Google Scholar
• Serra D, ReVelle CS (1994) Market capture by two competitors: The preemptive location problem. J. Regional Sci. 34(4):549–561.Crossref, Google Scholar
• Serra D, ReVelle CS (1995) Competitive location in discrete space. Drezner Z, ed. Facility Location: A Survey of Applications and Methods (Springer-Verlag, New York), 367–386.Crossref, Google Scholar
• Serra D, Ratick S, ReVelle CS (1996) The maximum capture problem with uncertainty. Environment Planning B: Planning Design 23(1):49–59.Crossref, Google Scholar
• Snyder LV (2011) Covering problems. Eiselt HA, Marianov V, eds. Foundations of Location Analysis (Springer, Berlin), 109–135.Crossref, Google Scholar