New collaborative approaches for bin-packing problems

This document describes new models and methodologies that we apply to three families of packing problems. We first study decomposition methods and meta-heuristics based on so-called strategic oscillation. We apply these techniques to packing problems with different kinds of conflicts. We also deal with the concept of \emph{dual-feasible functions}, which are used to derive polynomial-time lower bounds for several bin-packing problems. Finally, we propose new models for two different rectangle placement problems. We used these models into a constraint programming framework.