Solving the geometric firefighter routing problem via integer programming
Publication:1755409
DOI10.1016/J.EJOR.2018.10.037zbMath1430.90426OpenAlexW2899212774WikidataQ129006737 ScholiaQ129006737MaRDI QIDQ1755409
Mauricio J. O. Zambon, Pedro J. de Rezende, Cid Carvalho De Souza
Publication date: 9 January 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.10.037
integer programmingcombinatorial optimizationcomputational geometrygeometric firefighter routing problem
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- The firefighter problem: empirical results on random graphs
- The surviving rate of digraphs
- Firefighting on square, hexagonal, and triangular grids
- The surviving rate of an outerplanar graph for the firefighter problem
- The 2-surviving rate of planar graphs without 4-cycles
- The surviving rate of planar graphs
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- The firefighter problem for cubic graphs
- Finding exact solutions for the geometric firefighter problem in practice
- A lower bound of the surviving rate of a planar graph with girth at least seven
- The firefighter problem for graphs of maximum degree three
- More fires and more fighters
- The Surviving Rate of a Graph for the Firefighter Problem
- Estimation of Distribution Algorithms for the Firefighter Problem
- Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
This page was built for publication: Solving the geometric firefighter routing problem via integer programming