Scalable Relaxations of Sparse Packing Constraints: Optimal Biocontrol in Predator-Prey Network

by   Johan Bjorck, et al.

Cascades represent rapid changes in networks. A cascading phenomenon of ecological and economic impact is the spread of invasive species in geographic landscapes. The most promising management strategy is often biocontrol, which entails introducing a natural predator able to control the invading population, a setting that can be treated as two interacting cascades of predator and prey populations. We formulate and study a nonlinear problem of optimal biocontrol: optimally seeding the predator cascade over time to minimize the harmful prey population. Recurring budgets, which typically face conservation organizations, naturally leads to sparse constraints which make the problem amenable to approximation algorithms. Available methods based on continuous relaxations scale poorly, to remedy this we develop a novel and scalable randomized algorithm based on a width relaxation, applicable to a broad class of combinatorial optimization problems. We evaluate our contributions in the context of biocontrol for the insect pest Hemlock Wolly Adelgid (HWA) in eastern North America. Our algorithm outperforms competing methods in terms of scalability and solution quality, and finds near optimal strategies for the control of the HWA for fine-grained networks -- an important problem in computational sustainability.



page 1

page 6

page 8


Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms

Combinatorial optimization is widely applied in a number of areas nowada...

On Approximating (Sparse) Covering Integer Programs

We consider approximation algorithms for covering integer programs of th...

Submodular Function Maximization in Parallel via the Multilinear Relaxation

Balkanski and Singer [5] recently initiated the study of adaptivity (or ...

A Two-Layer Near-Optimal Strategy for Substation Constraint Management via Home Batteries

Within electrical distribution networks, substation constraints manageme...

Finding Sparse Solutions for Packing and Covering Semidefinite Programs

Packing and covering semidefinite programs (SDPs) appear in natural rela...

Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms

We consider the canonical L_0-regularized least squares problem (aka bes...

Hawkes Processes for Invasive Species Modeling and Management

The spread of invasive species to new areas threatens the stability of e...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.