S
Silvano Martello
Researcher at University of Bologna
Publications - 189
Citations - 17246
Silvano Martello is an academic researcher from University of Bologna. The author has contributed to research in topics: Knapsack problem & Bin packing problem. The author has an hindex of 52, co-authored 182 publications receiving 15991 citations. Previous affiliations of Silvano Martello include University of Turin.
Papers
More filters
Book
Knapsack Problems: Algorithms and Computer Implementations
Silvano Martello,Paolo Toth +1 more
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.
MonographDOI
Assignment Problems. Revised reprint.
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.
Journal ArticleDOI
Two-dimensional packing problems: A survey
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.
Book
Assignment problems
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.
Journal ArticleDOI
The Three-Dimensional Bin Packing Problem
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.