An aggregation heuristic for large scale p-median problem

[1]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[2]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[3]  Hrishikesh D. Vinod Mathematica.  Integer Programming and the Theory of Grouping , 1969 .

[4]  E. Hillsman,et al.  Errors in measuring distances from populations to service centers , 1978 .

[5]  H. Crowder,et al.  Cluster Analysis: An Application of Lagrangian Relaxation , 1979 .

[6]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[7]  T. Klastorin.  The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach , 1985 .

[8]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[9]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[10]  M. J. Hodgson,et al.  A GIS APPROACH TO ELIMINATING SOURCE C AGGREGATION ERROR IN P- MEDIAN MODELS. , 1993 .

[11]  J. Beasley.  Lagrangean heuristics for location problems , 1993 .

[12]  Pierre Hansen,et al.  Cluster analysis and mathematical programming , 1997, Math. Program..

[13]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[14]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[15]  José Luis González Velarde,et al.  Computing tools for modeling, optimization and simulation : interfaces in computer science and operations research , 2000 .

[16]  Timothy J. Lowe,et al.  Aggregation Error Bounds for a Class of Location Models , 2000, Oper. Res..

[17]  Luiz Antonio Nogueira Lorena,et al.  Lagrangean/Surrogate Heuristics for p-Median Problems , 2000 .

[18]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

[19]  Timothy J. Lowe,et al.  Worst‐case incremental analysis for a class of p‐facility location problems , 2002, Networks.

[20]  Éric D. Taillard,et al.  Heuristic Methods for Large Centroid Clustering Problems , 2003, J. Heuristics.

[21]  B. Jaumard,et al.  Cluster Analysis and Mathematical Programming , 2003 .

[22]  Mauricio G. C. Resende,et al.  A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.

[23]  Luiz Antonio Nogueira Lorena,et al.  A branch-and-price approach to p-median location problems , 2005, Comput. Oper. Res..

[24]  Yuri Kochetov,et al.  Computationally Difficult Instances for the Uncapacitated Facility Location Problem , 2005 .

[25]  Igor Vasil'ev,et al.  Computational study of large-scale p-Median problems , 2007, Math. Program..

[26]  Pierre Hansen,et al.  Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem , 2003, INFORMS J. Comput..

[27]  Pierre Hansen,et al.  The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..

[28]  Justo Puerto,et al.  Dynamic supply chain design with inventory , 2008, Comput. Oper. Res..

[29]  Joaquín A. Pacheco,et al.  Heuristic Solutions for Locating Health Resources , 2008, IEEE Intelligent Systems.

[30]  Pierre Hansen,et al.  Solving large p-median clustering problems by primal–dual variable neighborhood search , 2009, Data Mining and Knowledge Discovery.

[31]  Igor Vasil'ev,et al.  An effective heuristic for large-scale capacitated facility location problems , 2009, J. Heuristics.

[32]  J. Current,et al.  Elimination of Source A and B Errors in p‐Median Location Problems , 2010 .

[33]  Nenad Mladenovic,et al.  Variable neighbourhood decomposition search for 0-1 mixed integer programs , 2009, Comput. Oper. Res..

[34]  Martine Labbé,et al.  Solving Large p-Median Problems with a Radius Formulation , 2011, INFORMS J. Comput..

[35]  C. Beltran.  Solving the p-Median Problem with a Semi-Lagrangian Relaxation∗ , .