Geoscience Reference
In-Depth Information
References
Al-Sultan KS, Hussain MF, Nizami JS (1996) A genetic algorithm for the set covering problem. J
Oper Res Soc 47:702-709
Avella P, Boccia M, Vasilyev I (2009) Computational experience with general cutting planes for
the set covering problem. Oper Res Lett 37:16-20
Balas E (1980) Cutting planes from conditional bounds: a new approach to set covering. Math
Program 12:19-36
Balas E, Carrera MC (1996) A dynamic subgradient-based branch-and-bound procedure for set
covering. Oper Res 44:875-890
Balas E, Ho A (1980) Set covering algorithms using cutting planes, heuristics and subgradient
optimization: a computational study. Math Program 12:37-60
Balas E, Ng SM (1989a) On the set covering polytope: I. All the facets with coefficients in f0;1;2g.
Math Program 43:57-69
Balas E, Ng SM (1989b) On the set covering polytope: II. Lifting the facets with coefficients in
f0;1;2g. Math Program 45:1-20
Balas E, Padberg MW (1976) Set partitioning: a survey. SIAM Rev 18:710-760
Balinski ML (1965) Integer programming: methods, uses, computations. Manag Sci 12:253-313
Batta R, Mannur NR (1990) Covering-location models for emergency situations that require
multiple response units. Manag Sci 36:16-23
Batta R, Dolan JM, Krishnamurthy NN (1989) The maximal expected covering location problem:
revisited. Transp Sci 23:277-287
Beasley JE (1987) An algorithm for the set covering problem. Eur J Oper Res 31:85-93
Beasley JE (1990) A Lagrangian heuristic for set-covering problems. Nav Res Log 37:151-164
Beasley JE, Chu PC (1996) A genetic algorithm for the set covering problem. Eur J Oper Res
94:392-404
Beasley JE, Jørnsten K (1992) Enhancing an algorithm for set covering problems. Eur J Oper Res
58:293-300
Bell T, Church RL (1985) Location-allocation theory in archaeological settlement pattern research:
some preliminary applications. World Archaeol 16:354-371
Bellmore M, Ratliff HD (1971) Set covering and involutory bases. Manag Sci 18:194-206
Berge C (1957) Two theorems in graph theory. Proc Natl Acad Sci USA 43:842-844
Berman O, Drezner Z, Krass D (2010) Generalized coverage: new developments in covering
location models. Comput Oper Res 37:1675-1687
Broin MW, Lowe TJ (1986) A dynamic programming algorithm for covering problems with
(greedy) totally balanced constraint matrices. SIAM J Algebr Discrete Method 7:348-357
Brusco MJ, Jacobs LW, Thompson GM (1999) A morphing procedure to supplement a simulated
annealing heuristic for cost- and coverage-correlated set-covering problems. Ann Oper Res
86:611-627
Caprara A, Fischetti M, Toth P (1999) A heuristic method for the set covering problem. Oper Res
47:730-743
Caprara A, Toth P, Fischetti M (2000) Algorithms for the set covering problem. Ann Oper Res
98:353-371
Ceria S, Nobili P, Sassano A (1998) A Lagrangian-based heuristic for large-scale set covering
problems. Math Program 81:215-228
Chazelle BM, Lee DT (1986) On a circle placement problem. Computing 36:1-16
Christofides N, Korman S (1975) A computational survey of methods for the set covering problem.
Manag Sci 21:591-599
Chung C (1986) Recent applications of the maximal covering location planning (M.C.L.P.) model.
J Oper Res Soc 37:735-746
Church RL (1984) The planar maximal covering location problem. J Reg Sci 24:185-201
Church RL, Meadows ME (1979) Location modeling utilizing maximum service distance criteria.
Geogr Anal 11:358-373
