We consider a generalization of the classical quadratic assignment problem, where material
flows between facilities are uncertain, and belong to a budgeted uncertainty set. The …

Abstract We introduce the Minimum Flow Cost Hamiltonian Cycle Problem (FCHCP). Given
a graph and positive flow between pairs of vertices, the FCHCP consists of finding a …

This thesis deals with a new approach to tackle binary combinatorial optimization problems.
Generally speaking, the idea is to reduce the number of quadratic terms in the objective …

The competition between airports demands higher-quality services to satisfy passengers. A
Baggage Handling System (BHS) serves functions such as baggage sorting, screening, and …

In the last decades, the important increasing consumption of health care and the growing of
population make elimination of waste and continuous productivity improvement more and …

The quadratic assignment problem is a well studied and notoriously difficult combinatorial
problem. Recently, a discrete linear formulation of the quadratic assignment problem was …

In this paper we study a version of the Multidimensional Arrangement Problem (MAP) that
embeds a graph into a multidimensional array minimizing the aggregated (Manhattan) …

Model reformulation plays an important role in improving models, reducing search space so
that solutions can be found faster. Hence we categorise model reformulation into three …

This thesis deals with a new approach to tackle binary combinatorial optimization problems.
Generally speaking, the idea is to reduce the number of quadratic terms in the objective …

With the rise of cloud computing, data centers have been called to play a main role in the
Internet scenario nowadays. Despite this relevance, they are probably far from their zenith …