메뉴 건너뛰기




Volumn 9, Issue 1, 2005, Pages 35-47

Requiring connectivity in the set covering problem

Author keywords

Connected components; Graphs; Integer polytopes; Set covering

Indexed keywords

ALGORITHMS; BIODIVERSITY; GRAPH THEORY; NUMBER THEORY; OPTIMIZATION; SET THEORY; THEOREM PROVING;

EID: 17444369059     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10878-005-5482-5     Document Type: Article
Times cited : (20)

References (23)
  • 1
    • 0024302011 scopus 로고
    • On the set covering polytope: I. All facets with coefficients in {0, 1, 2}
    • E. Balas and S.M. Ng, "On the set covering polytope: I. all facets with coefficients in {0, 1, 2}," Mathematical Programming, vol. 43, pp. 57-69, 1989a.
    • (1989) Mathematical Programming , vol.43 , pp. 57-69
    • Balas, E.1    Ng, S.M.2
  • 2
    • 0024718441 scopus 로고
    • On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}
    • E. Balas and S.M. Ng, "On the set covering polytope: II. lifting the facets with coefficients in {0, 1, 2}," Mathematical Programming, vol. 45, pp. 1-20, 1989b.
    • (1989) Mathematical Programming , vol.45 , pp. 1-20
    • Balas, E.1    Ng, S.M.2
  • 3
    • 0036027669 scopus 로고    scopus 로고
    • Incorporating connectivity into reserve selection procedures
    • R.A. Briers, "Incorporating connectivity into reserve selection procedures," Biological Conservation, vol. 103, pp. 77-83, 2002.
    • (2002) Biological Conservation , vol.103 , pp. 77-83
    • Briers, R.A.1
  • 4
    • 0033998658 scopus 로고    scopus 로고
    • A survey and overview of habitat fragmentation
    • D.M. Debinski and R.D. Holt, "A survey and overview of habitat fragmentation," Conservation Biology, vol. 14, pp. 342-355, 2000.
    • (2000) Conservation Biology , vol.14 , pp. 342-355
    • Debinski, D.M.1    Holt, R.D.2
  • 5
    • 0024304271 scopus 로고
    • On the 0, 1 facets of the set covering polytope
    • G. Cornuéjols and A. Sassano, "On the 0, 1 facets of the set covering polytope," Mathematical Programming, vol. 43, pp. 45-55, 1989.
    • (1989) Mathematical Programming , vol.43 , pp. 45-55
    • Cornuéjols, G.1    Sassano, A.2
  • 8
    • 0036177956 scopus 로고    scopus 로고
    • Designing compact and contiguous reserve networks with a hybrid heuristic approach
    • D.J. Nalle, J.L. Arthur, and J. Sessions, "Designing compact and contiguous reserve networks with a hybrid heuristic approach," Forest Science, vol. 48, pp. 59-68, 2002.
    • (2002) Forest Science , vol.48 , pp. 59-68
    • Nalle, D.J.1    Arthur, J.L.2    Sessions, J.3
  • 9
    • 0027384478 scopus 로고
    • An upgraded reserve selection algorithm
    • A.O. Nicholls and C.R. Margules, "An upgraded reserve selection algorithm," Biological Conservation, vol. 64, pp. 165-169, 1993.
    • (1993) Biological Conservation , vol.64 , pp. 165-169
    • Nicholls, A.O.1    Margules, C.R.2
  • 10
    • 0024719469 scopus 로고
    • Facets and lifting procedures for the set covering polytope
    • P. Nobili and A. Sassano, "Facets and lifting procedures for the set covering polytope," Mathematical Programming, vol. 45, pp. 111-137, 1989.
    • (1989) Mathematical Programming , vol.45 , pp. 111-137
    • Nobili, P.1    Sassano, A.2
  • 12
    • 0037039007 scopus 로고    scopus 로고
    • Incorporating spatial criteria in optimum reserve network selection
    • H. Önal and R.A. Briers, "Incorporating spatial criteria in optimum reserve network selection," in Proceedings of the Royal Society, London B, 2002, vol. 269, pp. 2437-2441.
    • (2002) Proceedings of the Royal Society, London B , vol.269 , pp. 2437-2441
    • Önal, H.1    Briers, R.A.2
  • 13
    • 0037823381 scopus 로고    scopus 로고
    • Selection of a minimum-boundary reserve network using integer programming
    • H. Önal and R.A. Briers, "Selection of a minimum-boundary reserve network using integer programming," in Proceedings of the Royal Society, London B, 2003, vol. 270, pp. 1487-1491.
    • (2003) Proceedings of the Royal Society, London B , vol.270 , pp. 1487-1491
    • Önal, H.1    Briers, R.A.2
  • 14
    • 0002368325 scopus 로고    scopus 로고
    • Mathematical methods for identifying representative reserve networks
    • S. Person and M. Burgman (Eds.), Springer-Verlag: New York
    • H. Possingham, I. Ball, and S. Andelman, "Mathematical methods for identifying representative reserve networks," in Quantitative Methods for Conservation Biology, S. Person and M. Burgman (Eds.), Springer-Verlag: New York, 2000, pp. 291-306.
    • (2000) Quantitative Methods for Conservation Biology , pp. 291-306
    • Possingham, H.1    Ball, I.2    Andelman, S.3
  • 17
    • 0040513949 scopus 로고
    • Über teiler, faktoren und charakteristische polynome von graphen. II
    • H. Sachs, "Über teiler, faktoren und charakteristische polynome von graphen. II," Wiss Z. Tech. Hochsch Ilmenau, vol. 13, pp. 405-412, 1967.
    • (1967) Wiss Z. Tech. Hochsch Ilmenau , vol.13 , pp. 405-412
    • Sachs, H.1
  • 18
    • 0024681830 scopus 로고
    • On the facial structure of the set covering polytope
    • A. Sassano, "On the facial structure of the set covering polytope," Mathematical Programming, vol. 44, pp. 181-202, 1989.
    • (1989) Mathematical Programming , vol.44 , pp. 181-202
    • Sassano, A.1
  • 19
    • 0036795396 scopus 로고    scopus 로고
    • Method for selection of old-forest reserves
    • P. Siitonen, A. Tanskanen, and A. Lehtinen, "Method for selection of old-forest reserves," Conservation Biology, vol. 16, pp. 1398-1408, 2002.
    • (2002) Conservation Biology , vol.16 , pp. 1398-1408
    • Siitonen, P.1    Tanskanen, A.2    Lehtinen, A.3
  • 20
    • 0037992514 scopus 로고    scopus 로고
    • Selecting forest reserves with a multiobjective spatial algorithm
    • P. Siitonen, A. Tanskanen, and A. Lehtinen, "Selecting forest reserves with a multiobjective spatial algorithm," Environmental Science & Policy, vol. 6, pp. 301-309, 2003.
    • (2003) Environmental Science & Policy , vol.6 , pp. 301-309
    • Siitonen, P.1    Tanskanen, A.2    Lehtinen, A.3
  • 21
    • 2942643466 scopus 로고    scopus 로고
    • Applications of the set covering, set packing and partitioning models: A survey
    • D.-Z. Du and P. Pardalos (Eds.), Kluwer Academic Publishers: Boston
    • R.R. Vemuganti, "Applications of the set covering, set packing and partitioning models: A survey," in Handbook of Combinatorial Optimization, vol. 1, D.-Z. Du and P. Pardalos (Eds.), Kluwer Academic Publishers: Boston, 1998, pp. 573-746.
    • (1998) Handbook of Combinatorial Optimization , vol.1 , pp. 573-746
    • Vemuganti, R.R.1
  • 22
    • 0043229632 scopus 로고    scopus 로고
    • Delineating protected wildlife corridors with multi-objective programming
    • J.C. Williams, "Delineating protected wildlife corridors with multi-objective programming," Environmental Modeling and Assessment, vol. 3, pp. 77-86, 1998.
    • (1998) Environmental Modeling and Assessment , vol.3 , pp. 77-86
    • Williams, J.C.1
  • 23
    • 34250395041 scopus 로고
    • Faces for a linear inequality in 0-1 variables
    • L. Wolsey, "Faces for a linear inequality in 0-1 variables," Mathematical Programming, vol. 8, pp. 165-178, 1975.
    • (1975) Mathematical Programming , vol.8 , pp. 165-178
    • Wolsey, L.1


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