메뉴 건너뛰기




Volumn 35, Issue 4, 2003, Pages 277-289

The multi-level location set covering model

Author keywords

[No Author keywords available]

Indexed keywords

FACILITY LOCATION; LINEAR PROGRAMING; LOCATION DECISION; MODEL;

EID: 0242626536     PISSN: 00167363     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1538-4632.2003.tb01115.x     Document Type: Article
Times cited : (33)

References (35)
  • 1
    • 0013356499 scopus 로고
    • Covering-location models for emergency situations that require multiple response units
    • Batta, R., and N. R. Mannur (1990). "Covering-Location Models for Emergency Situations that Require Multiple Response Units." Management Science 36, 16-23.
    • (1990) Management Science , vol.36 , pp. 16-23
    • Batta, R.1    Mannur, N.R.2
  • 3
    • 0001306720 scopus 로고    scopus 로고
    • The geography of imperilment: Targeting conservation towards critical biodiversity areas
    • edited by B. A. Stein, L. S. Kutner, and J. S. Adams. New York: Oxford University Press
    • Chaplin, S. J., R. A. Gerrard, H. M. Watson, L. L. Master, and S. R. Flack (2000). "The Geography of Imperilment: Targeting Conservation Towards Critical Biodiversity Areas." In Precious Heritage: Status of Biodiversity in the United States, edited by B. A. Stein, L. S. Kutner, and J. S. Adams. New York: Oxford University Press.
    • (2000) Precious Heritage: Status of Biodiversity in the United States
    • Chaplin, S.J.1    Gerrard, R.A.2    Watson, H.M.3    Master, L.L.4    Flack, S.R.5
  • 4
    • 21344478285 scopus 로고
    • Algorithms for large scale set covering problems
    • Christofides, N., and J. Paixao (1993). "Algorithms for Large Scale Set Covering Problems." Annals of Operations Research 43, 261-277.
    • (1993) Annals of Operations Research , vol.43 , pp. 261-277
    • Christofides, N.1    Paixao, J.2
  • 5
    • 0018676522 scopus 로고
    • Location modeling utilizing maximum distance criteria
    • Church, R. L., and M. E. Meadows (1979). "Location Modeling Utilizing Maximum Distance Criteria." Geographical Analysis 11, 358-73.
    • (1979) Geographical Analysis , vol.11 , pp. 358-373
    • Church, R.L.1    Meadows, M.E.2
  • 7
    • 0242447350 scopus 로고
    • Theoretical links between median and coverage location problems
    • Church, R. L., and J. R. Weaver (1986). "Theoretical Links Between Median and Coverage Location Problems." Annals of Operations Research 6, 1-19.
    • (1986) Annals of Operations Research , vol.6 , pp. 1-19
    • Church, R.L.1    Weaver, J.R.2
  • 8
    • 0000301097 scopus 로고
    • A greedy heuristic for the set-covering problem
    • Chvatal, V. (1979). "A Greedy Heuristic for the Set-Covering Problem." Mathematics of Operations Research 26, 233-35.
    • (1979) Mathematics of Operations Research , vol.26 , pp. 233-235
    • Chvatal, V.1
  • 9
    • 84985846021 scopus 로고
    • Locating emergency warning sirens
    • Current, J., and M. O'Kelly (1992). "Locating Emergency Warning Sirens." Decision Sciences 23, 221-34.
    • (1992) Decision Sciences , vol.23 , pp. 221-234
    • Current, J.1    O'Kelly, M.2
  • 10
    • 0025005843 scopus 로고
    • Analysis errors due to demand data aggregation in set covering and maximal covering location problems
    • Current, J., and D. Schilling (1990). "Analysis Errors Due to Demand Data Aggregation in Set Covering and Maximal Covering Location Problems." Geographical Analysis 22, 116-26.
    • (1990) Geographical Analysis , vol.22 , pp. 116-126
    • Current, J.1    Schilling, D.2
  • 11
    • 0020707868 scopus 로고
    • A maximum expected covering location model: Formulation, properties and heuristic solution
    • Daskin, M. (1983). "A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution." Transportation Science 17, 48-69.
    • (1983) Transportation Science , vol.17 , pp. 48-69
    • Daskin, M.1
  • 13
    • 0001323645 scopus 로고    scopus 로고
    • An exact algorithm for the maximal covering problem
    • Downs B. T., and J. D. Camm (1996). "An Exact Algorithm for the Maximal Covering Problem." Naval Research Logistics 43, 435-61.
    • (1996) Naval Research Logistics , vol.43 , pp. 435-461
    • Downs, B.T.1    Camm, J.D.2
  • 15
    • 0024640804 scopus 로고
    • A probabilistic heuristic for a computationally difficult set covering problem
    • Feo, T. A., and M. G. C. Resende (1989). "A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem." Operations Research Letters 8, 67-71.
    • (1989) Operations Research Letters , vol.8 , pp. 67-71
    • Feo, T.A.1    Resende, M.G.C.2
  • 17
    • 0031076486 scopus 로고    scopus 로고
    • Simple Lagrangian heuristic for the set covering problem
    • Haddadi, S. (1997). "Simple Lagrangian Heuristic for the Set Covering Problem." European Journal of Operational Research 97, 200-204.
    • (1997) European Journal of Operational Research , vol.97 , pp. 200-204
    • Haddadi, S.1
  • 19
    • 0002641457 scopus 로고
    • Concepts and applications of backup coverage
    • Hogan, K., and C. ReVelle (1986). "Concepts and Applications of Backup Coverage." Management Science 32, 1434-44.
    • (1986) Management Science , vol.32 , pp. 1434-1444
    • Hogan, K.1    ReVelle, C.2
  • 20
    • 0026417997 scopus 로고
    • A multiobjective approach to evaluating and planning the allocation of inspection resources
    • Klimberg, G. R., C. ReVelle, and J. Cohon (1991). "A Multiobjective Approach to Evaluating and Planning the Allocation of Inspection Resources." European Journal of Operational Research 52, 55-64.
    • (1991) European Journal of Operational Research , vol.52 , pp. 55-64
    • Klimberg, G.R.1    ReVelle, C.2    Cohon, J.3
  • 21
    • 0000983414 scopus 로고
    • Computer solutions to minimum-cover problems
    • Roth, R. (1969). "Computer Solutions to Minimum-Cover Problems." Operations Research 17, 455-65.
    • (1969) Operations Research , vol.17 , pp. 455-465
    • Roth, R.1
  • 27
    • 84977388536 scopus 로고
    • Binary logic solutions to a class of location problem
    • Toregas, C., and C. ReVelle (1973). "Binary Logic Solutions to a Class of Location Problem." Geographical Analysis 5, 145-55.
    • (1973) Geographical Analysis , vol.5 , pp. 145-155
    • Toregas, C.1    ReVelle, C.2
  • 28
    • 0028133927 scopus 로고
    • Optimal and suboptimal reserve selection algorithms
    • Underhill, L. (1994). "Optimal and Suboptimal Reserve Selection Algorithms." Biological Conservation 70, 85-87.
    • (1994) Biological Conservation , vol.70 , pp. 85-87
    • Underhill, L.1
  • 29
    • 85039613276 scopus 로고
    • Technical Report #S012. Department of Electrical Engineering and Computer Science, Stevens Institute of Technology, Hoboken, N.J
    • Van Slyke, R. (1981). "Covering Problems in C31 Systems." Technical Report #S012. Department of Electrical Engineering and Computer Science, Stevens Institute of Technology, Hoboken, N.J.
    • (1981) Covering Problems in C31 Systems
    • Van Slyke, R.1
  • 30
    • 0020293216 scopus 로고
    • Redundant set covering in telecommunications networks
    • Virginia Beach, Va., October 11-13
    • Van Slyke, R. (1982). "Redundant Set Covering in Telecommunications Networks." In Proceedings IEEE Large Scale Systems Symposium. Virginia Beach, Va., October 11-13, 217-22.
    • (1982) Proceedings IEEE Large Scale Systems Symposium , pp. 217-222
    • Van Slyke, R.1
  • 31
    • 0021387178 scopus 로고
    • An efficient heuristic for large set covering problems
    • Vasko, F., and G. Wilson (1984). "An Efficient Heuristic for Large Set Covering Problems." Naval Research Logistics Quarterly 32, 163-71.
    • (1984) Naval Research Logistics Quarterly , vol.32 , pp. 163-171
    • Vasko, F.1    Wilson, G.2
  • 32
    • 0022709468 scopus 로고
    • Hybrid heuristics for minimum cardinality set covering problems
    • Vasko, F., and G. Wilson (1986). "Hybrid Heuristics for Minimum Cardinality Set Covering Problems." Naval Research Logistics Quarterly 33, 241-49.
    • (1986) Naval Research Logistics Quarterly , vol.33 , pp. 241-249
    • Vasko, F.1    Wilson, G.2
  • 35
    • 84916434028 scopus 로고
    • Primal-dual heuristics for multiple set covering
    • Xiaoming, L., and R. Van Slyke (1984). "Primal-Dual Heuristics for Multiple Set Covering." Congressus Numerantium 41,
    • (1984) Congressus Numerantium , vol.41 , pp. 63-73
    • Xiaoming, L.1    Van Slyke, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.