Designing compact and contiguous reserve networks with a hybrid heuristic algorithm

Forest Science

Volumn 48, Issue 1, 2002, Pages 59-68

  Nalle, Darek J ^a   Arthur, Jeffrey L ^a   Sessions, John ^a  

^a UNIVERSITY OF NEVADA   (United States)

Author keywords

Heuristics; Nature reserve problem; Quadratic 0 1 programming

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; ECOSYSTEMS; HEURISTIC METHODS; LAND RECLAMATION; MANAGERS; SUSTAINABLE DEVELOPMENT;

LAND RESERVE NETWORKS;

FORESTRY;

ALGORITHM; ENVIRONMENTAL FACTOR; ENVIRONMENTAL MANAGEMENT; ENVIRONMENTAL PROTECTION; ENVIRONMENTAL SUSTAINABILITY; HABITAT FRAGMENTATION; HABITAT STRUCTURE; LAND USE; SIMULATION; UNITED STATES;

EID: 0036177956     PISSN: 0015749X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. Species distributions, land values, and efficient conservation
2. Finding all optimal solutions to the reserve site selection problem: Formulation and computational analysis
3. Reserve selection as a maximal covering location problem
4. Reserve designs for species preservation
5. Using mathematical programming to address the multiple reserve selection problem: An example from the Eyre Peninsula, South Australia
6. Tabu search - Part I
7. Tabu search - Part II
8. An integer optimization approach to a probabilistic reserve site selection problem
9. Constrained simultaneous confidence intervals for multiple comparisons with the best
10. A comparison of direct and environmental domain approaches to planning reservation of forest higher plant communities and species in Tasmania
11. Optimization by simulated annealing
12. Optimal clustering: A model and method
13. Using siting algorithms in the design of marine reserve networks
14. Equation of state calculations by fast computing machines
15. Selection of areas for protecting rare plants with integration of land use conflicts: A case study for the West Coast of Newfoundland
16. Protected areas: How much is enough?
17. The mathematics of designing a network of protected areas for conservation
18. Mathematical methods for identifying representative reserve networks
19. Effectiveness of alternative heuristic algorithms for identifying indicative minimum requirements for conservation reserves
20. Size of selection units for future reserves and its influence on actual vs. targeted representation of features: A case study in Western New South Wales
21. An optimization approach to selecting research natural areas in national forests
22. The Klamath surprise: Forestry meets diversity on the West Coast
23. A 0-1 programming approach to delineating protected reserves
24. Reserve assemblage of critical areas: A zero-one programming approach