Showing papers by "Daniele Vigo published in 2005"
TL;DR: A characterization of the algorithm proposed by Martello et al. (2000) for the exact solution of the three-dimensional bin packing problem is given, showing that not all orthogonal packings can be generated by the proposed algorithm.
Abstract: In the three-dimensional bin packing problem the task is to orthogonally pack a given set of rectangular items into a minimum number of three-dimensional rectangular bins We give a characterization of the algorithm proposed by Martello et al (2000) for the exact solution of the problem, showing that not all orthogonal packings can be generated by the proposed algorithm The packings, however, have the property of being robot packings, which is relevant in practical settings References to the modified algorithm, which solves the orthogonal as well as robot packable three-dimensional problem, are given
44 citations