Logic-based Benders decomposition for wildfire suppression
From MaRDI portal
Publication:6068720
DOI10.1016/j.cor.2023.106392arXiv2209.01371OpenAlexW4385987974MaRDI QIDQ6068720
Michael A. Forbes, Thomas Taimre, Mitchell G. Harris
Publication date: 13 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.01371
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Methods for removing links in a network to minimize the spread of infections
- Matching interdiction
- The capacitated standard response fire protection siting problem: Deterministic and probabilistic models
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- The Benders decomposition algorithm: a literature review
- LP formulations of the shortest path tree problem
- Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- A survey of network interdiction models and algorithms
- Fire containment in grids of dimension three and higher
- Generalized Benders decomposition
- Bilevel Knapsack with Interdiction Constraints
- Logic-Based Benders Decomposition for Large-Scale Optimization
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Maximizing the minimum source-sink path subject to a budget constraint
- An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression
- Minimum vertex blocker clique problem
- Shortest-path network interdiction
- Removing Arcs from a Network
- Canonical Cuts on the Unit Hypercube
- A matheuristic for the firefighter problem on graphs
