An efficient tabu search procedure for the p-Median Problem
- 1 January 1997
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 96 (2) , 329-342
- https://doi.org/10.1016/s0377-2217(96)00141-5
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- The median tour and maximal covering tour problems: Formulations and heuristicsEuropean Journal of Operational Research, 1994
- Avoiding local optima in thep-hub location problem using tabu search and GRASPAnnals of Operations Research, 1992
- A more efficient heuristic for solving largep-median problemsPapers in Regional Science, 1992
- A search heuristic for just-in-time scheduling in parallel machinesJournal of Intelligent Manufacturing, 1991
- Robust taboo search for the quadratic assignment problemParallel Computing, 1991
- Tabu search techniquesOR Spectrum, 1989
- STABULUS: A technique for finding stable sets in large graphs with tabu searchComputing, 1989
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986
- An Algorithmic Approach to Network Location Problems. II: Thep-MediansSIAM Journal on Applied Mathematics, 1979
- Central Facilities LocationGeographical Analysis, 1970