메뉴 건너뛰기




Volumn 47, Issue 3, 2001, Pages 403-418

Using the branch and bound algorithm to solve forest planning problems with adjacency constraints

Author keywords

Area based forest planning; Integer programming; Spatial optimization

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; OPTIMIZATION; PROBLEM SOLVING;

EID: 0035181007     PISSN: 0015749X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (33)

References (29)
  • 2
  • 3
    • 0032925712 scopus 로고    scopus 로고
    • An analysis of Monte Carlo integer programming, simulated annealing, and tabu search heuristics for solving spatial harvest scheduling problems
    • (1999) For. Sci. , vol.45 , Issue.2 , pp. 292-301
    • Boston, K.1    Bettinger, P.2
  • 7
    • 0006666510 scopus 로고    scopus 로고
    • CPLEX Incline Village, Nevada. (Cited in Boston and Bettinger 1999)
    • (1998)
  • 9
    • 0032212039 scopus 로고    scopus 로고
    • Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems
    • (1998) For. Sci. , vol.44 , Issue.4 , pp. 526-538
    • Hoganson, H.M.1    Borges, J.G.2
  • 16
    • 0033861204 scopus 로고    scopus 로고
    • Comparing adjacency constraint formulations for randomly generated forest planning problems with four age-class distributions
    • (2000) For. Sci. , vol.46 , Issue.3 , pp. 423-436
    • McDill, M.E.1    Braze, J.2
  • 26
    • 0030991883 scopus 로고    scopus 로고
    • Dynamic selection of harvests with adjacency restrictions: The SHARe model
    • (1997) For. Sci. , vol.43 , Issue.2 , pp. 213-222
    • Snyder, S.1    ReVelle, C.2
  • 27
    • 0006749308 scopus 로고
    • National Forest Management Act. (88 Stat. 476; 16 U.S.C. 1601-1610), October 22
    • (1976)


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