Geoscience Reference
In-Depth Information
Church RL, ReVelle C (1974) The maximal covering location problem. Pap Reg Sci Assoc
32:101-118
Church RL, ReVelle C (1976). Theoretical and computational links between the p-median, location
set-covering, and the maximal covering location problem. Geogr Anal 8:406-415
Church RL, Weaver JR (1986) Theoretical links between median and coverage location problems.
Ann Oper Res 6:1-19
Church RL, Stoms DM, Davis FW (1996) Reserve selection as a maximal covering location
problem. Biol Conserv 76:105-112
Chvátal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4:233-235
Cornuéjols G, Sassano A (1989). On the 0,1 facets of the set covering polytope. Math Program
43:45-55
Cornuéjols G, Nemhauser GL, Wolsey LA (1980) A canonical representation of simple plant
location problems and its applications. SIAM J Algebr Discrete Method 1:261-272
Current JR, Schilling DA (1990) Analysis of errors due to demand data aggregation in the set
covering and maximal covering location problems. Geogr Anal 22:116-126
Current JR, Storbeck JE (1988) Capacitated covering problems. Environ Plan B 15:153-163
Curtin KM, Hayslett-McCall K, Qiu F (2010) Determining optimal police patrol areas with
maximal covering and backup covering location models. Netw Span Econ 10:125-145
Daskin MS (1983) A maximum expected covering location model: formulation, properties and
heuristic solution. Transp Sci 17:48-70
Daskin MS (1995) Covering problems. In: Networks and discrete location. Models, algorithms and
applications. Wiley, New York, pp 92-153
Daskin MS, Stern EH (1981) A hierarchical objective set covering model for emergency medical
service vehicle deployment. Transp Sci 15:137-152
Daskin MS, Haghani AE, Khanal M, Malandraki C (1989) Aggregation effects in maximum
covering problems. Ann Oper Res 18:115-140
Downs BT, Camm JD (1996) An exact algorithm for the maximal covering problem. Nav Res Log
43:435-461
Drezner Z (1981) On a modified one-center problem. Manag Sci 27:848-851
Drezner Z, Wesolowsky GO, Drezner T (2004) The gradual covering problem. Nav Res Log
51:841-855
Dwyer FP, Evans JR (1981) A branch and bound algorithm for the list selection problem in direct
mail advertising. Manag Sci 27:658-667
Eaton DJ, Sánchez HML, Lantigua RR, Morgan J (1986) Determining ambulance deployment in
Santo Domingo, Dominican Republic. J Oper Res Soc 37:113-126
Elzinga D, Hearn D (1972) Geometric solutions for some minimax location problems. Transp Sci
6:379-394
Etcheberry J (1977) The set-covering problem: a new implicit enumeration algorithm. Oper Res
25:760-772
Farahani RZ, Asgari N, Heidari N, Hosseininia M, Goh M (2012) Covering problems in facility
location: a review. Comput Ind Eng 62:368-407
Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering
problem. Oper Res Lett 8:67-71
Fisher ML, Kedia P (1990) Optimal solutions of set covering/partitioning problems using dual
heuristics. Manag Sci 36:674-688
Galvão RD, ReVelle C (1996) A Lagrangean heuristic for the maximal covering location problem.
Eur J Oper Res 88:114-123
Galvão RD, Espejo LGA, Boffey B (2000) A comparison of Lagrangean and surrogate relaxations
for the maximal covering location problem. Eur J Oper Res 124:377-389
Galvão RD, Chiyoshia FY, Morabito R (2005) Towards unified formulations and extensions of two
classical probabilistic location models. Comput Oper Res 32:15-33
García S, Labbé M, Marín A (2011) Solving large p-median problems with a radius formulation.
INFORMS J Comput 23:546-556
