Optimisation problems in Healthcare have received considerable attention for more than
three decades. More recently, however, with decreasing birth rates in nearly all of the
developed countries and increasing average longevity globally, optimisation issues in …

In recent years, the field of combinatorial optimization has witnessed a true tsunami of
“novel” metaheuristic methods, most of them based on a metaphor of some natural or man‐
made process. The behavior of virtually any species of insects, the flow of water, musicians …

Disasters are on the rise, more complex, and donor support is increasingly unpredictable. In
response to this trend humanitarian agencies are looking for more efficient and effective
solutions. This paper discusses the evolution of supply chain management in disaster relief …

This paper surveys the most important algorithmic and computational results on the Vertex
Coloring Problem (VCP) and its generalizations. The first part of the paper introduces the
classical models for the VCP, and discusses how these models can be used and possibly …

The demand for humanitarian aid is extraordinarily large and it is increasing. In contrast, the
funding for humanitarian operations does not seem to be increasing at the same rate.
Humanitarian logistics has the challenge of allocating scarce resources to complex …

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for
combinatorial optimization. It is a multi‐start or iterative process, in which each GRASP
iteration consists of two phases, a construction phase, in which a feasible solution is …

Abstract The Molecular Distance Geometry Problem consists in finding the positions in of the
atoms of a molecule, given some of the inter‐atomic distances. We show that under an
additional requirement on the given distances this can be transformed to a combinatorial …

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for
combinatorial optimization. It is a multi‐start or iterative process, in which each GRASP
iteration consists of two phases, a construction phase, in which a feasible solution is …

A mathematical model of the problem is constructed. A feasible region and peculiarities of
the problem are investigated. Extremum of a linear objective function is searched at extreme
points. To solve the problem a solution method based on a combination of the branch-and …

In the last 25 years, extensive research has been carried out addressing the flexible job
shop scheduling (JSS) problem. A variety of techniques ranging from exact methods to
hybrid techniques have been used in this research. The paper aims at presenting the …