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 …

Iterated greedy algorithms belong to the class of stochastic local search methods. They are
based on the simple and effective principle of generating a sequence of solutions by …

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 …

The firefighter problem is a graph-based optimization problem that can be used for
modelling the spread of fires, and also for studying the dynamics of epidemics. Recently, this …

The firefighter problem is a deterministic discrete-time model for the spread and containment
of fire on a graph. Once the fire breaks out at a set of vertices, the goal addressed in this …

This research develops an initial attack plan for combating forest fires in any wildland areas
susceptible to fire outbreaks. To be eligible for such a plan, the landscape must have been …

The firefighter problem (FFP) is used as a model to simulate how a fire breaks out and
spreads to its surroundings over a discrete time period. The goal is to deploy a given …

In the firefighter problem the spread of fire is modelled on an undirected graph. The goal is
to find such an assignment of firefighters to the nodes of the graph that they save as large …

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 …

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) …