The frequency and impact of wildfires have considerably increased in the past decade, due to the extreme weather conditions as well as the increased population density. The aim of this study is to introduce, model, and solve a wildfire suppression problem that involves multiple types of fire suppression resources and their operational characteristics. Two integer programming (IP) formulations, a basic IP and its reformulation with combinatorial Benders’ cuts, are presented. The performances of the proposed formulations are evaluated on a set of randomly generated instances. The results indicate that the proposed formulations are able to obtain high quality upper and lower bounds. Extensive numerical experiments are performed to analyse the effects of several operational constraints on the computational performance of the models. A case study arising in Yatağan district of Muğla province of Türkiye is presented.

中文翻译：

---

多类资源的野火扑灭问题

过去十年，由于极端天气条件和人口密度增加，野火的频率和影响显着增加。本研究的目的是介绍、建模和解决涉及多种类型灭火资源及其运行特征的野火扑灭问题。提出了两个整数规划 (IP) 公式、一个基本 IP 及其使用组合 Benders 割减的重新公式。所提出的配方的性能在一组随机生成的实例上进行评估。结果表明，所提出的公式能够获得高质量的上限和下限。进行了大量的数值实验来分析几种操作约束对模型计算性能的影响。介绍了土耳其穆拉省亚塔甘地区的案例研究。