A graph theory approach for designing conservation reserve networks with minimal fragmentation

DOI10.1002/net.20211zbMath1180.90035OpenAlexW4237408903MaRDI QIDQ5449669

Yicheng Wang, Hayri Önal

Publication date: 12 March 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20211

zbMATH Keywords

graphinteger programmingcyclesfragmentationcontiguitytheoryreserve designDantzig cuts

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items

Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach, The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences, Optimal design of compact and functionally contiguous conservation management areas, Achieving full connectivity of sites in the multiperiod reserve network design problem, Solving Steiner trees: Recent advances, challenges, and perspectives, A new method to solve the fully connected reserve network design problem

Cites Work

• Unnamed Item