Towards a Characterization of Difficult Instances of the Bin Packing Problem

We address the multidimensional characterization of difficult instances of the Bin Packing Problem, well known in the combinatorial optimization realm. In search for efficient procedures to solve hard combinatorial optimization problems previous investigations have attempted to identify the instances' characteristics with the greatest impact in their difficulty. In the same vein and focusing on th...