Baum, E.B. (1986). “Toward Practical ‘Neural’ Computation for Combinatorial Optimization Problems.” In J. Denker (ed.), *Neural Networks for Computing*. New York: American Institute of Physics.

Beasley, J.E. (1985). “A Note on Solving Large *p*-Median Problems.” *European Journal of Operational Research* 21, 270–273.

Bellman, R. and S. Dreyfuss. (1962). *Applied Dynamic Programming*, Princeton: Princeton University Press.

Boese, K.D., A.B. Kahng, and S. Muddu. (1994). “A New Adaptive Multi-Start Technique for Combinatorial Global Optimizations.” *Operations Research Letters* 16, 101–113.

Brandeau, M.L. and S.S. Chiu. (1989). “An Overview of Representative Problems in Location Research.” *Management Science* 35(6), 645–674.

Captivo, E.M. (1991). “Fast Primal and Dual Heuristics for the *p*-Median Location Problem.” *European Journal of Operational Research* 52, 65–74.

Carraghan, R. and P.M. Pardalos. (1990). “An Exact Algorithm for the Maximum Clique Problem.” *Operations Research Letters* 9, 375–382.

Christofides, N. (1975). *Graph Theory: An Algorithmic Approach*. New York: Academic Press.

Cornuejols, G., M.L. Fisher, and G.L. Nemhauser. (1977). “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms.” *Management Science* 23, 789–810.

Densham, P.J. and G. Rushton. (1992). “A More Efficient Heuristic for Solving Large *p*-Median Problems.” *Papers in Regional Science* 71(3), 307–329.

Drezner, Z. (ed.). (1995). *Facility Location. A survey of Applications and Methods*. New York: Springer.

du Merle, O., D. Villeneuve, J. Desrosiers, and P. Hansen. (1999). “Stabilized Column Generation.” *Discrete Mathematics* 194, 229–237.

Erlenkotter, D. (1978). “A Dual-Based Procedure for Uncapacitated Facility Location.” *Operations Research* 26, 992–1009.

Galvao, R.D. (1980). “A Dual-Bounded Algorithm for the *p*-Median Problem.” *Operations Research* 28, 1112–1121.

Glover, F. (1989). “Tabu Search—Part I.” *ORSA Journal on Computing* 1, 190–206.

Glover, F. (1990). “Tabu Search—Part II.” *ORSA Journal on Computing* 2, 4–32.

Glover, F. and M. Laguna. (1993). “Tabu Search.” In C. Reeves (ed.), *Modern Heuristic Techniques for Combinatorial Problems*, Ch. 3, Oxford: Blackwell.

Glover, F. and M. Laguna. (1997). *Tabu Search*. Norwell, MA: Kluwer Academic Publishers.

Glover, F., C. McMillan, and R. Glover. (1984). “A Heuristic Approach to the Employee Scheduling Problem and Some Thoughts on “Managerial Robots.” *Journal of Operations Management* 4, 113–128.

Griffith, R.E. and R.A. Stewart. (1961). “A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems.” *Management Science* 7, 379–392.

Hanjoul, P. and D. Peeters. (1985). “A Comparison of Two Dual-Based Procedures for Solving the *p*-Median Problem.” *European Journal of Operational Research* 20, 387–396.

Hansen, P. and B. Jaumard. (1990). “Algorithms for the Maximum Satisfiability Problem.” *Computing* 44, 279–303.

Hansen, P. and B. Jaumard. (1997). “Cluster Analysis and Mathematical Programming.” *Mathematical Programming* 79, 191–215.

Hansen, P. and L. Kaufman. (1972). “Comparaison d'Algorithmes Pour le Problème de la Localisation des Enterpôts.” In J. Brennan (ed.), *Operational Research in Industrial Systems*. London: English University Press, pp. 281–294.

Hansen, P. and N. Mladenović. (1997). “Variable Neighborhood Search for the *p*-Median.” *Location Science* 5, 207–226.

Hansen, P. and N. Mladenović. (1998). “An Introduction to Variable Neighborhood Search.” In S. Voss et al. (eds.), *Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization*. Dordrecht: Kluwer, pp. 433–458.

Kariv, O. and S.L. Hakimi. (1969). “An Algorithmic Approach to Network Location Problems; Part 2. The *p*-Medians.” *SIAM Journal on Applied Mathematics* 37, 539–560.

Kirkpatrick, S., C.D. Gelatt, and M.P. Vecchi. (1983). “Optimization by Simulated Annealing.” *Science* 220, 671–680.

Kuehn, A.A. and M.J. Hamburger. (1963). “A Heuristic Program for Locating Warehouses.” *Management Science* 9(4), 643–666.

Maranzana, F.E. (1964). “On the Location of Supply Points to Minimize Transportation Costs.” *Operations Research Quarterly* 12, 138–139.

Mirchandani, P. and R. Francis (eds.). (1990). *Discrete Location Theory*. Wiley-Interscience.

Mladenović, N. (1995). “A Variable Neighborhood Algorithm—A New Metaheuristic for Combinatorial Optimization.” Presented at Optimization Days, Montreal.

Mladenović, N. and P. Hansen. (1997). “Variable Neighborhood Search.” *Computers and Operations Research* 24, 1097–1100.

Mladenović, N., J.P. Moreno, and J. Moreno-Vega. (1995). “Tabu Search in Solving *p*-Facility Location – Allocation Problems.” *Les Cahiers du GERAD, G-95–38*, Montreal.

Mladenović, N., J.P. Moreno, and J. Moreno-Vega. (1996). “A Chain-Interchange Heuristic Method.” *Yugoslav Journal of Operations Research* 6(1), 41–54.

Moreno, J., C. Rodrigez, and N. Jimenez. (1991). “Heuristic Cluster Algorithm for Multiple Facility Location-Allocation Problem.” *RAIRO—Recherche Operationnelle/Operations Research* 25, 97–107.

Osman, I. and N. Christofides. (1994). “Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search.” *Int. Trans. Oper. Res.* 1(3), 317–336.

Pizzolato, N.D. (1994). “A Heuristic for Large-Size *p*-Median Location Problems with Application to School Location.” *Annals of Operations Research* 50, 473–485.

Reinelt, G. (1991). “TSPLIB—A Traveling Salesman Problem Library.” *ORSA Journal on Computing* 3, 376–384.

Rolland, E., D.A. Schilling, and J.R. Current. (1996). “An Efficient Tabu Search Procedure for the *p*-Median Problem.” *European Journal of Operational Research* 96, 329–342.

Rosing, K.E. and C.S. ReVelle. (1997). “Heuristic Concentration: Two Stage Solution Construction.” *European Journal of Operational Research* 97, 75–86.

Rosing, K.E., C.S. ReVelle, E. Rolland, D.A. Schilling, and J.R. Current. (1998). “Heuristic Concentration and Tabu Search: A Head to Head Comparison.” *European Journal of Operational Research* 104, 93–99.

Rosing, K.E. (1998). Private communication.

Teitz, M.B. and P. Bart. (1968). “Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph.” *Operations Research* 16(5), 955–961.

Voss, S. (1996). “A Reverse Elimination Approach for the *p*-Median Problem.” *Studies in Locational Analysis* 8, 49–58.

Whitaker, R. (1983). “A Fast Algorithm for the Greedy Interchange for Large-Scale Clustering and Median Location Problems.” *INFOR* 21, 95–108.