A matheuristic for the firefighter problem on graphs

DOI10.1111/itor.12638OpenAlexW2912496731WikidataQ128367623 ScholiaQ128367623MaRDI QIDQ6067888

Cid Carvalho De Souza, Natanael Ramos, Unnamed Author

Publication date: 17 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12638

zbMATH Keywords

heuristicscombinatorial optimizationinteger linear programmingfirefighter problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

Surviving rate of graphs and firefighter problem ⋮ Logic-based Benders decomposition for wildfire suppression ⋮ Iterated local search for the placement of wildland fire suppression resources

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The firefighter problem: empirical results on random graphs
• The firefighter problem for cubic graphs
• Greedy randomized adaptive search procedures
• The firefighter problem for graphs of maximum degree three
• Approximability of the firefighter problem. Computing cuts over time
• Fire containment in grids of dimension three and higher
• Parameterized Complexity of Firefighting Revisited
• Parameterized Complexity of the Firefighter Problem
• Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
• Approximations of the critical region of the fbietkan statistic
• Politician’s Firefighting

This page was built for publication: A matheuristic for the firefighter problem on graphs