Silvano Martello

TL;DR: This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.

TL;DR: This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments and can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science.

TL;DR: This work considers problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste by discussing mathematical models, lower bounds, classical approximation algorithms, recent heuristic and metaheuristic methods and exact enumerative approaches.

TL;DR: A comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments can be found in this article, where the authors have organized the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly.

TL;DR: An exact algorithm for filling a single bin is developed, leading to the definition of an exact branch-and-bound algorithm for the three-dimensional bin packing problem, which also incorporates original approximation algorithms.