Advancing firefighter games: novel integer programming formulations and the cost-value model
From MaRDI portal
Cites work
- A lower bound of the surviving rate of a planar graph with girth at least seven
- A matheuristic for the firefighter problem on graphs
- A robust optimisation approach for the placement of forest fire suppression resources
- An analysis of the weighted firefighter problem
- Continuous firefighting on infinite square grids
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Fifty years of operational research in forestry
- Fire containment in grids of dimension three and higher
- Fire Containment in Planar Graphs
- Firefighting on square, hexagonal, and triangular grids
- Firefighting on trees
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
- scientific article; zbMATH DE number 2061798 (Why is no real title available?)
- scientific article; zbMATH DE number 1506515 (Why is no real title available?)
- scientific article; zbMATH DE number 3016052 (Why is no real title available?)
- Operations research challenges in forestry: 33 open problems
- Planar graph is on fire
- Slash and burn on graphs -- firefighting with general weights
- Surviving rates of graphs with bounded treewidth for the firefighter problem
- The firefighter problem for graphs of maximum degree three
- The Firefighter problem: a survey of results, directions and questions
- The firefighter problem: empirical results on random graphs
- UAV routing by simulation-based optimization approaches for forest fire risk mitigation
This page was built for publication: Advancing firefighter games: novel integer programming formulations and the cost-value model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318306)
