Optimal Selection of a Connected Reserve Network
Operations Research
Computational experiments with heuristics for two nature reserve site selection problems
Computers and Operations Research
Connections in Networks: Hardness of Feasibility Versus Optimality
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Dynamic Reserve Selection: Optimal Land Retention with Land-Price Feedbacks
Operations Research
A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
Operations Research Letters
| Hi-index | 0.00 |
We analyze the problem of maximizing the expected number of species in a nature reserve network, subject to a constraint on the number of sites in the network, given probabilistic information about species occurrences. The problem is a nonlinear binary integer program that is NP-hard. We develop a linear integer programming approximation that may be solved with standard integer programming software. We compare the approximation with two other approaches, an expected greedy approach and a probability hurdle approach, using probabilistic data on occurrences of terrestrial vertebrates in the state of Oregon. Results of the approximation and an exact algorithm are compared by using samples from the North American Breeding Bird Survey.