Finding exact solutions for the geometric firefighter problem in practice

DOI10.1016/J.COR.2018.05.003MaRDI QIDQ1652708zbMATH OpenOpenAlexWikidataFDO

Authors Mauricio J. O. Zambon, Pedro J. de Rezende, Cid Carvalho de Souza

Publication date 11 July 2018

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2018.05.003

zbMATH Keywords

combinatorial optimizationcomputational geometryinteger programminggeometric firefighter problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Integer programming (90C10)

Recommendations

• Approximation algorithms for the geometric firefighter and budget fence problems
• Approximation algorithms for the geometric firefighter and budget fence problems
• Solving the geometric firefighter routing problem via integer programming
• Geometric firefighting in the half-plane
• Geometric firefighting in the half-plane

Cites work

• scientific article; zbMATH DE number 1802810 (Why is no real title available?)
• 3/2 firefighters are not enough
• A fire fighter's problem
• A lower bound of the surviving rate of a planar graph with girth at least seven
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• Algorithms for Reporting and Counting Geometric Intersections
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Approximation algorithms for the geometric firefighter and budget fence problems
• Estimation of distribution algorithms for the firefighter problem
• Fire containment in grids of dimension three and higher
• Firefighting on square, hexagonal, and triangular grids
• More fires and more fighters
• The 2-surviving rate of planar graphs without 4-cycles
• The firefighter problem for cubic graphs
• The firefighter problem for graphs of maximum degree three
• The firefighter problem: empirical results on random graphs
• The surviving rate of a graph for the firefighter problem
• The surviving rate of an outerplanar graph for the firefighter problem
• The surviving rate of digraphs
• The surviving rate of planar graphs

Cited in

(8)

• Surviving rate of graphs and firefighter problem
• The wildfire suppression problem with multiple types of resources
• Solving the geometric firefighter routing problem via integer programming
• The Firefighter Problem: A Structural Analysis
• Approximation algorithms for the geometric firefighter and budget fence problems
• Approximation algorithms for the geometric firefighter and budget fence problems
• Iterated local search for the placement of wildland fire suppression resources
• The firefighter problem: further steps in understanding its complexity

This page was built for publication: Finding exact solutions for the geometric firefighter problem in practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652708)