Geoscience Reference
In-Depth Information
Fisher ML (1981) The Lagrangian relaxation method for solving integer programming problems.
Manag Sci 27:1-18
Fisher ML (1985) An applications oriented guide to Lagrangian relaxation. Interfaces 15:10-21
Glover F (1990) Tabu search: a tutorial. Interfaces 20:74-94
Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Boston
Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-
Wesley, Reading
Goldman AJ (1971) Optimal center location in simple networks. Transp Sci 5:212-221
Hakimi SL (1964) Optimum location of switching centers and the absolute centers and medians of
a graph. Oper Res 12:450-459
Hakimi SL (1965) Optimum distribution of switching centers in a communication network and
some related graph theoretic problems. Oper Res 13:462-475
Hansen P, Mladenovic N (1997) Variable neighborhood search for the
P
-median. Locat Sci
5: 207-226
Hansen P, Mladenovic N (2001) Variable neighborhood search: principles and applications for the
p
-median. Eur J Oper Res 130:449-467
Haupt RL, Haupt SE (1998) Practical genetic algorithms. Wiley, New York
Holland J (1975) Adaption in natural and artificial systems. The University of Michigan Press, Ann
Arbor
Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. II: the
p
-medians . SIAM J Appl Math 37:539-560
Kirkpatrick S (1984) Optimization by simulated annealing: quantitative studies. J Stat Phys
34:975-986
Maranzana FE (1964) On the location of supply points to minimize transport costs. Oper Res Q
15:261-270
Michalewicz Z (1994) Genetic algorithms
C
data structures
D
evolution programs, 2nd edn.
Springer, Berlin
Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Cambridge
Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097-1100
Mladenovic N, Brimberg J, Hansen P, Moreno-Perez JA (2007) The
p
-median problem: a survey
of metaheuristic approaches. Eur J Oper Res 179:927-939
Murray AT, Church RL (1996) Applying simulated annealing to location-planning problems. J
Heuristics 2:31-53
ReVelle CS, Eiselt HA, Daskin MS (2008) A bibliography of some fundamental problem
categories in discrete location science. Eur J Oper Res 184:817-848
Rolland E, Schilling DA, Current JR (1996) An efficient tabu search procedure for the
p
-median
problem. Eur J Oper Res 96:329-342
Rosing KE, ReVelle CS (1997) Heuristic concentration: two stage solution construction. Eur J
Oper Res 97:75-86
Rosing KE, ReVelle CS, Rolland E, Schilling DA, Current JR (1998) Heuristic concentration and
tabu search: a head-to-head comparison. Eur J Oper Res 104:93-99
Tamir A (1996) An
O
(
pn
2
) algorithm for the
p
-median and related problems on tree graphs. Oper
Res Lett 19:59-64
Teitz MB, Bart P (1968) Heuristic methods for estimating generalized vertex median of a weighted
graph. Oper Res 16:955-961
