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 …

In this paper, a method for knowledge-based optimization of vaccination assignments is
proposed, which combines multiobjective optimization algorithms with counter-epidemic …

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 …

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 …

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 …

The original formulation of the firefighter problem defines a discrete-time process where a
fire starts at a designated subset of the vertices of a graph G. At each subsequent discrete …

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 …

The firefighter problem is a graph-based optimization problem in which the goal is to
effectively prevent the spread of a threat in a graph using a limited supply of resources …

The Firefighter Problem (FFP) is an optimization problem of develo** an optimal strategy
for assigning firemen to nodes of a given graph in successive iterations of a simulation of …

The Firefighter Problem (FFP) is a graph-based optimization problem that is an abstraction
of real-life problems such as epidemics control, economic crises prevention, etc. In the FFP …