# Logic-Based benders Decomposition for Wildfire Suppression

arXiv: https://arxiv.org/abs/2209.01371 · HTML: https://mlsanity.com/paper/2209.01371/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 3 Sep 2022.

## Built on by (most cited first, 1 of 1)

- [Wildfire Suppression: Complexity, Models, and Instances](https://mlsanity.com/paper/2603.29865/) (2026)

## Abstract (arXiv)

We study the problem of locating fire suppression resources in a burning landscape in order to minimise the total area burned. The landscape is modelled as a directed graph, with nodes representing regions of the landscape, and arcs representing adjacency relationships. The fire spread is modelled using the minimum travel time principle. We propose a non-linear integer programming formulation and an exact solution approach utilising logic-based Benders decomposition. We benchmark the approach against a mixed integer program and an iterated local search metaheuristic from the literature. We are able to solve challenging instances to proven optimality in a reasonable amount of time.