Scheduling conservation designs for maximum flexibility via network cascade optimization

DOI10.1613/JAIR.4679MaRDI QIDQ5176856zbMATH OpenOpenAlexWikidataFDO

Authors Shan Xue, Alan Fern, Daniel R. Sheldon

Publication date 4 March 2015

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4679

zbMATH Keywords

budget usagescheduling problemSteiner tree problem: Steiner graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic scheduling theory in operations research (90B35) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Ecology (92D40)

Recommendations

• Achieving full connectivity of sites in the multiperiod reserve network design problem
• ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem
• Nature Reserve Site Selection to Maximize Expected Species Covered
• Reserve design for species preservation
• A new method to solve the fully connected reserve network design problem

Cited in

(1)

• Designing higher value roads to preserve species at risk by optimally controlling traffic flow

This page was built for publication: Scheduling conservation designs for maximum flexibility via network cascade optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176856)