We consider the problem of, given a landscape represented by a gridded network and a fire
ignition location, deciding where to locate the available fire suppression resources to …

Wildfires are recurrent natural events that have been increasing in frequency and severity in
recent decades. They threaten human lives and damage ecosystems and infrastructure …

In this paper, a graph-based optimization problem related to epidemics control is studied.
This multiobjective optimization problem requires determining which graph nodes to protect …

Abstract The Minimum Spanning Tree problem (abbr. MSTP) is a well-known combinatorial
optimization problem that has been extensively studied by the researchers in the field of …

The firefighter problem (FFP) is a combinatorial problem requiring the allocation of
'firefighters' to nodes in a graph in order to protect the nodes from fire (or other threat) …

One of the approaches to combinatorial optimization is to use global search methods, such
as evolutionary algorithms combined with local search procedures. Local search can be …

In this paper, we describe a computational study conducted on The Firefighter Problem
(FFP), which models fire spreading and containment in a graph. Once the fire breaks out on …

In this paper, we introduce the Geometric Firefighter Routing Problem (gfrp) as a variant of
the Geometric Firefighter Problem aiming to better model more realistic situations. We …

Firefighter is a discrete-time dynamic process that models the spread of a virus or rumour
through a network. The name “Firefighter” arises from the initial analogy being the spread of …

Abstract In the Geometric Firefighter Problem (gfp), one aims to maximize the total area
shielded from a fire that radiates from a point inside a polygonal region, by constructing a …