Local search algorithms have been successfully used for many combinatorial optimisation
problems. The choice of the most suitable local search algorithm is, however, a challenging …

In this paper, we introduce a generalization of the vector bin packing problem, where the
bins have variable sizes. This generalization can be used to model virtual machine …

Meta's private cloud uses millions of servers to host tens of thousands of services that power
multiple products for billions of users. This complex environment has various optimization …

A model of a complex object is presented and a set of meaningful operations, both basic and
advanced, on a single complex object and on a configuration of complex objects is defined …

Abstract Large neighborhood search (LNS)[25] is a framework that combines the
expressiveness of constraint programming with the efficiency of local search to solve …

Data centers are a critical and ubiquitous resource for providing infrastructure for banking,
Internet and electronic commerce. One way of managing data centers efficiently is to …

One of the main underlying themes of the previous chapters has been to demonstrate that
there is no single solver that performs best across a broad set of problem types and …

This paper addresses a process-to-machine reassignment problem arising in cloud
computing environments. The problem formulation has been posed as the ROADEF/EURO …

EnergeTIC is a recent industrial research project carried out in Grenoble on optimizing
energy consumption in data-centres. The efficient management of a data-centre involves …

Modern Chip Multiprocessors (CMPs) are integrating an increasing amount of cores to
address the continually growing demand for high-application performance. The cores of a …