Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Soulé (1991)
Conservation: tactics for a constant crisis.Science, 253 5021
J. Wright, C. Revelle, J. Cohon (1983)
A multiobjective integer programming model for the land acquisition problemRegional Science and Urban Economics, 13
H.P. Possingham, J.R. Day, M. Goldfinch, F. Salzborn (1993)
Decision Sciences: Tools for Today. Proceedings of 12th National ASOR Conference
K. Gilbert, D. Holmes, R. Rosenthal (1985)
A Multiobjective Discrete Optimization Model for Land AllocationManagement Science, 31
S. Kirkpatrick, C. Gelatt, Mario Vecchi (1983)
Optimization by Simulated AnnealingScience, 220
M. Lundy, A. Mees (1986)
Convergence of an annealing algorithmMathematical Programming, 34
W. Fagan, R. Cantrell, C. Cosner (1999)
How Habitat Edges Change Species InteractionsThe American Naturalist, 153
(1998)
Comparison of mathematical algorithms for the design of a reserve system for nature conservation: An application of genetic algorithms and simulated annealing
R. Pressey, H. Possingham, C. Margules (1996)
Optimality in reserve selection algorithms: When does it matter and how much?Biological Conservation, 76
M.R. Garey, D.S. Johnson (1979)
Computers and Intractability: A Guide to the Theory of NP-Completeness
H. Possingham, I. Ball, S. Andelman (2000)
Mathematical Methods for Identifying Representative Reserve Networks
H. Possingham, J. Day, M. Goldfinch, F. Salzborn (1993)
The mathematics of designing a network of protected areas for conservation
R. Pressey, H. Possingham, J. Day (1997)
Effectiveness of alternative heuristic algorithms for identifying indicative minimum requirements for conservation reservesBiological Conservation, 80
I. Ball (2000)
Mathematical applications for conservation ecology : the dynamics of tree hollows and the design of nature reserves / Ian R. Ball.
J. Cohon (2004)
Multiobjective programming and planning
R. Otten, L. Ginneken (1989)
The Annealing Algorithm
(1990)
Conserving the World’s Biodiversity (IUCN Publication Services, Gland
H. Possingham, I. Ball, S. Andelman (2000)
Quantitative Methods for Conservation Biology
A. Nicholls, C. Margules (1993)
An upgraded reserve selection algorithmBiological Conservation, 64
J.A. McNeely, K.R. Miller, W.V. Reid, R.A. Mittermeier, T.B. Werner (1990)
Conserving the World's Biodiversity
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
The problem of designing spatially cohesive nature reserve systems that meet biodiversity objectives is formulated as a nonlinear integer programming problem. The multiobjective function minimises a combination of boundary length, area and failed representation of the biological attributes we are trying to conserve. The task is to reserve a subset of sites that best meet this objective. We use data on the distribution of habitats in the Northern Territory, Australia, to show how simulated annealing and a greedy heuristic algorithm can be used to generate good solutions to such large reserve design problems, and to compare the effectiveness of these methods.
Environmental Modeling & Assessment – Springer Journals
Published: Oct 10, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.