Variable neighborhood search for the p-median

[1]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[2]  Roberto D. Galvão,et al.  A Dual-Bounded Algorithm for the p-Median Problem , 1980, Oper. Res..

[3]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[4]  Nelio Domingues Pizzolato,et al.  A heuristic for large-sizep-median location problems with application to school location , 1994, Ann. Oper. Res..

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

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

[7]  Dominique Peeters,et al.  A comparison of two dual-based procedures for solving the p-median problem , 1985 .

[8]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

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

[10]  José Andrés Moreno Pérez,et al.  A Chain-interchange Tabu Search Method (Tabu search in solving p -facility location-allocation problems) , 1995 .

[11]  Jacques Desrosiers,et al.  Stabilisation dans le cadre de la génération de colonnes , 1997 .

[12]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

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

[14]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[15]  John S. Denker,et al.  Neural Networks for Computing , 1998 .

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

[17]  J. Beasley.  A note on solving large p-median problems , 1985 .

[18]  J. M. Moreno-Vega,et al.  THE CHAIN-INTERCHANGE HEURISTIC METHOD1 , 1996 .

[19]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[20]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[21]  Francesco E. Maranzana,et al.  On the Location of Supply Points to Minimize Transportation Costs , 1963, IBM Syst. J..

[22]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

[23]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[24]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[25]  M. E. Captivo.  Fast primal and dual heuristics for the p-median location problem , 1991 .

[26]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[27]  M. Brandeau,et al.  An overview of representative problems in location research , 1989 .

[28]  JoséA. Moreno,et al.  Heuristic cluster algorithm for multiple facility location-allocation problem , 1991 .

[29]  R. A. Whitaker,et al.  A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems , 1983 .

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