Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Nemhauser, L. Wolsey (1988)
Integer and Combinatorial Optimization
J. Beasley (1984)
An algorithm for the steiner problem in graphsNetworks, 14
R. Mwalyosi (1991)
Ecological evaluation for wildlife corridors and buffer zones for Lake Manyara National Park, Tanzania, and its immediate environmentBiological Conservation, 57
D. Saunders, R. Hobbs (1991)
The role of corridors in conservation: what do we know and where do we go?
M. Soulé, D. Simberloff (1986)
What do genetics and ecology tell us about the design of nature reservesBiological Conservation, 35
R. Pressey, H. Possingham, C. Margules (1996)
Optimality in reserve selection algorithms: When does it matter and how much?Biological Conservation, 76
J.C. Williams, C.S. ReVelle (1996)
A 0–1 programming approach to delineating protected areasEnvironment and Planning B: Planning and Design, 23
E. Ulungu, J. Teghem (1994)
Multi‐objective combinatorial optimization problems: A surveyJournal of Multi-criteria Decision Analysis, 3
R. Pressey, H. Possingham, J. Day (1997)
Effectiveness of alternative heuristic algorithms for identifying indicative minimum requirements for conservation reservesBiological Conservation, 80
R. Noss, D. Saunders, R. Hobbs (1993)
Nature Conservation 2: The Role of CorridorsJournal of Wildlife Management, 57
L. Underhill (1994)
Optimal and suboptimal reserve selection algorithmsBiological Conservation, 70
M.E. Soulé (1991)
Land use planning and wildlife maintenanceJournal of the American Planning Association, 57
C. Mann, M. Plummer (1993)
The high cost of biodiversity.Science, 260 5116
J. Allen (1986)
Multiobjective regional forest planning using the noninferior set estimation (NISE) method in Tanzania and the united statesForest Science, 32
S. Dreyfus, Robert Wagner (1971)
The steiner problem in graphsNetworks, 1
(1990)
Using the CPLEX Linear Optimizer
Justin Williams, C. Revelle (1997)
Applying mathematical programming to reserve selectionEnvironmental Modeling & Assessment, 2
C. Margules, A. Higgs, R. Rafe (1982)
Modern biogeographic theory: Are there any lessons for nature reserve design?Biological Conservation, 24
J. Williams, C. Revelle (1996)
A 0–1 Programming Approach to Delineating Protected ReservesEnvironment and Planning B: Planning and Design, 23
D. Simberloff, J. Cox (1987)
Consequences and Costs of Conservation CorridorsConservation Biology, 1
S. Hakimi (1971)
Steiner's problem in graphs and its implicationsNetworks, 1
M. Soulé (1991)
Land Use Planning and Wildlife Maintenance: Guidelines for Conserving Wildlife in an Urban LandscapeJournal of The American Planning Association, 57
Justin Williams, C. Revelle (1998)
Reserve assemblage of critical areas: A zero-one programming approachEuropean Journal of Operational Research, 104
R. Keeney, H. Raiffa, D. Rajala (1977)
Decisions with Multiple Objectives: Preferences and Value Trade-OffsIEEE Transactions on Systems, Man, and Cybernetics, 9
C. Mann, M. Plummer (1995)
Are Wildlife Corridors the Right Path?Science, 270
J.L. Cohon (1978)
Multiobjective Programming and Planning
M. Ryan, R. Primack (1994)
Essentials of Conservation BiologyJournal of Wildlife Management, 59
P. Winter (1987)
Steiner problem in networks: A surveyNetworks, 17
R. Wong (1984)
A dual ascent approach for steiner tree problems on a directed graphMathematical Programming, 28
J. Sessions (1992)
Solving for Habitat Connections as a Steiner Network ProblemForest Science, 38
L. Rasmussen (1986)
Zero--one programming with multiple criteriaEuropean Journal of Operational Research, 26
N. Maculan (1987)
The Steiner Problem in GraphsNorth-holland Mathematics Studies, 132
R. Church, D. Stoms, F. Davis (1996)
Reserve selection as a maximal covering location problemBiological Conservation, 76
H. Salkin, K. Mathur (1989)
Foundations of integer programming
Protected wildlife corridors can help counteract habitat fragmentation and link isolated reserve “islands” into connected reserve systems. The need for wildlife corridors will grow as expanding human populations place increasing pressure on remaining undeveloped land. A two‐objective zero–one programming model is formulated for the problem of selecting land for a system of wildlife corridors that must connect a known set of existing reserves or critical habitat areas. This problem is modeled as a network Steiner tree problem, under the objectives of minimizing corridor land costs and minimizing the amount of unsuitable land within the corridor system. Linear programming is used to find exact solutions with little or no branching and bounding, and the multi‐objective weighting method is used to generate non‐inferior alternatives. Two hypothetical examples demonstrate the model and solution procedure. Results can help inform planning and decision making for protected area land acquisition and habitat restoration.
Environmental Modeling & Assessment – Springer Journals
Published: Oct 13, 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.