Silvano Martello

Papers

Total Citations

140

H-Index

About

Silvano Martello is a towering figure in combinatorial optimization, best known for his foundational work on packing and cutting problems. His research primarily focuses on the exact and heuristic solution of NP-hard problems, with a particular emphasis on two-dimensional and three-dimensional bin packing. Martello’s major contributions include the development of exact algorithms for the notoriously difficult three-dimensional bin packing problem, which seeks to minimize the number of rectangular bins needed to pack a set of boxes. His most-cited work, "Algorithm 864" (2007, 94 citations), provides a powerful computational framework for solving this strongly NP-hard problem, characterizing relevant subclasses of packing to achieve practical solutions. Additionally, his 2005 erratum (46 citations) clarified the robot-packable and orthogonal variants of these packing problems, refining the algorithm originally proposed in 2000. With a career spanning decades, Martello has profoundly influenced operations research and logistics, and his algorithms remain benchmarks in the field. His work is essential reading for students and researchers tackling complex packing and scheduling challenges.