Geoscience Reference
In-Depth Information
Garey MR, Johnson DS (1979) Computers and intractibility: a guide to the theory of NP-
completeness. WH Freeman and Co., San Francisco
Guignard M (2003) Lagrangean relaxation. TOP 11:151-200
Hakimi SL (1965) Optimum distribution of switching centers in a communication network and
some related graph theoretic problems. Oper Res 13:462-475
Hogan
K,
ReVelle
C
(1986)
Concepts
and
applications
of
backup
coverage.
Manag
Sci
32:1434-1444
Hohn F (1955) Mathematical aspects of switching. Am Math Mon 62:75-90
Jacobs LW, Brusco MJ (1995) Note: a local-search heuristic for large set-covering problems. Nav
Res Log 42:1129-1140
Klastorin TD (1979) On the maximal covering location problem and the generalized assignment
problem. Manag Sci 25:107-112
Kolen A, Tamir A (1990) Covering problems. In: Mirchandani PB, Francis RL (eds) Discrete
location theory. Wiley, New York, pp 263-304
Krarup J, Pruzan PM (1983) The simple plant location problem: survey and synthesis. Eur J Oper
Res 12:36-81
Lemke CE, Salkin HM, Spielberg K (1971) Set covering by single branch enumeration with linear
programming subproblems. Oper Res 19:998-1022
Lorena LAN, Lopes FB (1994) A surrogate heuristic for set covering problems. Eur J Oper Res
79:138-150
Mannino C, Sassano A (1995) Solving hard set covering problems. Oper Res Lett 18:1-5
Megiddo N, Zemel E, Hakimi SL (1983) The maximum coverage location problem. SIAM J Algebr
Discrete Method 4:253-261
Neebe AW (1988) A procedure for locating emergency-service facilities for all possible response
distances. J Oper Res Soc 39:743-748
Nobili P, Sassano A (1989) Facets and lifting procedures for the set covering polytope. Math
Program 45:111-137
Norman RZ, Rabin MO (1959) An algorithm for a minimum cover of a graph. Proc Am Math Soc
10:315-319
Plane DR, Hendrick TE (1977) Mathematical programming and the location of fire companies for
the Denver fire. Oper Res 25:563-578
Plastria F (2002) Continuous covering location problems. In: Hamacher HW, Drezner Z (eds)
Facility location: applications and theory. Springer, New York, pp 37-79
ReVelle C (1989) Review, extension and prediction in emergency service siting models. Eur J Oper
Res 40:58-69
ReVelle C, Hogan K (1989a) The maximum reliability location problem and Ǜ-reliable p-center
problem: derivatives of the probabilistic location set covering problem. Ann Oper Res
18:155-174
ReVelle C, Hogan K (1989b) The maximum availability location problem. Transp Sci 23:192-200
Roth R (1969) Computer solutions to minimum-cover problems. Oper Res 17:455-465
Sánchez-García M, Sobrón MI, Vitoriano B (1998) On the set covering polytope: facets with
coefficients in f0;1;2;3g. Ann Oper Res 81:343-356
Sassano A (1989) On the facial structure of the set covering polytope. Math Program 44:181-202
Schilling DA, Jayaraman V, Barkhi R (1993) A review of covering problems in facility location.
Locat Sci 1:25-55
Snyder LV (2011) Covering problems. In: Eiselt HA, Marianov V (eds) Foundations of location
analysis. Springer, Berlin, pp 109-135
Storbeck JE (1988) The spatial structuring of central places. Geogr Anal 20:93-110
Storbeck JE, Vohra RV (1988) A simple trade-off model for maximal and multiple coverage. Geogr
Anal 20:220-230
Toregas C, Revelle C (1972) Optimal location under time or distance constraints. Pap Reg Sci
Assoc 28:133-144
