On the Weber facility location problem with limited distances and side constraints

[1]  Pierre Hansen,et al.  An improved column generation algorithm for minimum sum-of-squares clustering , 2009, Math. Program..

[2]  Zvi Drezner,et al.  Generalized coverage: New developments in covering location models , 2010, Comput. Oper. Res..

[3]  André Morais Gurgel.  Melhoria da segurança pública: uma proposta para alocação de unidades policiais utilizando o modelo das p-medianas e do caixeiro viajante , 2010 .

[4]  Leo Liberti,et al.  Branching and bounds tighteningtechniques for non-convex MINLP , 2009, Optim. Methods Softw..

[5]  Paul R. Harper,et al.  Locational analysis: highlights of growth to maturity , 2009, J. Oper. Res. Soc..

[6]  Leo Liberti,et al.  Reformulations in Mathematical Programming: Definitions and Systematics , 2009, RAIRO Oper. Res..

[7]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

[8]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[9]  Leo Liberti,et al.  Writing Global Optimization Software , 2006 .

[10]  Hoang Tuy,et al.  Optimization under Composite Monotonic Constraints and Constrained Optimization over the Efficient Set , 2006 .

[11]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[12]  Joseph S. B. Mitchell,et al.  On the Continuous Fermat-Weber Problem , 2005, Oper. Res..

[13]  G. O. Wesolowsky,et al.  The gradual covering problem , 2004 .

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

[15]  Jorge J. Moré,et al.  The NEOS Server , 1998 .

[16]  Jack Brimberg,et al.  Accelerating convergence in the Fermat-Weber location problem , 1998, Oper. Res. Lett..

[17]  Pierre Hansen,et al.  Heuristic solution of the multisource Weber problem as a p-median problem , 1996, Oper. Res. Lett..

[18]  Edward M. B. Smith,et al.  Global optimisation of nonconvex MINLPs , 1997 .

[19]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[20]  George O. Wesolowsky,et al.  THE WEBER PROBLEM: HISTORY AND PERSPECTIVES. , 1993 .

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

[22]  Zvi Drezner,et al.  The Facility Location Problem with Limited Distances , 1991, Transp. Sci..

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

[24]  Kenneth L. Roberts,et al.  Generalized coverage models and public facility location , 1983 .

[25]  G. O. Wesolowsky,et al.  A Maximin Location Problem with Maximum Distance Constraints , 1980 .

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