The problem addressed in this paper is that of orthogonally packing a given set of
rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The …

We consider problems requiring to allocate a set of rectangular items to larger rectangular
standardized units by minimizing the waste. In two-dimensional bin packing problems these …

Two new algorithms recently proved to outperform all previous methods for the exact solution
of the 0-1 Knapsack Problem. This paper presents a combination of such approaches, …

While the 1980s were focused on the solution of large sized “easy” knapsack problems (KPs),
this decade has brought several new algorithms, which are able to solve “hard” large …

When SIAM asked us to prepare a new edition of this book after less than three years from
publication, we expected a light duty. Just the correction of some typos and imprecisions, and …

… Edited by Stefan Voẞ Technical University of Braunschweig, Germany Silvano Martello …
Macready, Santa Fe Nelson Maculan, Rio de Janeiro Vittorio Maniezzo, Bologna Silvano Martello…

Given a weighted graph with profits associated with the vertices, the selective travelling
salesman problem (or orienteering problem) consists of selecting a simple circuit of maximal total …

Given a set of rectangular pieces to be cut from an unlimited number of standardized stock
pieces (bins), the Two-Dimensional Finite Bin Packing Problem is to determine the minimum …

Two-dimensional bin packing problems consist of allocating, without overlapping, a given
set of small rectangles (items) to a minimum number of large identical rectangles (bins), with …

… The first four classes were proposed by Martello and Vigo [43], and are based on the
generation of items of four different types: … A better (tighter) bound was proposed by …