The minimum weighted covering location problem with distance constraints

[1]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[2]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[3]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[4]  C. S. Orloff.  A Theoretical Model of Net Accessibility in Public Facility Location , 1977 .

[5]  Subhash C. Narula,et al.  Technical Note - An Algorithm for the p-Median Problem , 1977, Oper. Res..

[6]  R. Garfinkel,et al.  Locating an Obnoxious Facility on a Network , 1978 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[9]  I. Moon,et al.  An Analysis of Network Location Problems with Distance Constraints , 1984 .

[10]  S. T. McCormick,et al.  Locating independent facilities with maximum weight: Greedy heuristics , 1986 .

[11]  Erhan Erkut,et al.  Analytical models for locating undesirable facilities , 1989 .

[12]  H. Pirkul,et al.  The Maximal Covering Location Problem with Capacities on Total Workload , 1991 .

[13]  Arie Tamir,et al.  Obnoxious Facility Location on Graphs , 1991, SIAM J. Discret. Math..

[14]  G. Nemhauser,et al.  A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing , 1992 .

[15]  Reza Barkhi,et al.  A REVIEW OF COVERING PROBLEMS IN FACILITY LOCATION. , 1993 .

[16]  G. O. Wesolowsky,et al.  FINDING THE CIRCLE OR RECTANGLE CONTAINING THE MINIMUM WEIGHT OF POINTS. , 1994 .

[17]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[18]  D. West.  Introduction to Graph Theory , 1995 .

[19]  Zvi Drezner,et al.  Minimum covering criterion for obnoxious facility location on a network , 1996 .

[20]  J. Current,et al.  An efficient tabu search procedure for the p-Median Problem , 1997 .

[21]  Alan T. Murray,et al.  Solving the anti-covering location problem using Lagrangian relaxation , 1997, Comput. Oper. Res..

[22]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[23]  Mohammad Abdulrahman Al-Fawzan,et al.  A tabu search approach to the uncapacitated facility location problem , 1999, Ann. Oper. Res..

[24]  Zvi Drezner,et al.  A note on the location of an obnoxious facility on a network , 2000, Eur. J. Oper. Res..

[25]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[26]  Charles ReVelle,et al.  Reserve Design and Facility Siting , 2002 .

[27]  Zvi Drezner,et al.  The expropriation location problem , 2003, J. Oper. Res. Soc..

[28]  Pascal Van Hentenryck,et al.  A simple tabu search for warehouse location , 2004, Eur. J. Oper. Res..

[29]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[30]  Alan T. Murray,et al.  IMPACT MODELS FOR SITING UNDESIRABLE FACILITIES , 2005 .

[31]  M. Kuby.  Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems , 2010 .

[32]  R. Church,et al.  Location Modeling Utilizing Maximum Service Distance Criteria , 2010 .

[33]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.