Edgar Den Boef

Papers

Total Citations

140

H-Index

About

Edgar Den Boef is a leading researcher in combinatorial optimization, with a primary focus on the notoriously difficult three-dimensional bin packing problem (3D-BPP). His most influential work, "Algorithm 864" (2007), which has garnered 94 citations, tackles the challenge of orthogonally packing rectangular boxes into the minimum number of bins—a problem that is NP-hard in the strong sense. In this paper, Den Boef characterizes relevant subclasses of packing problems, providing critical insights into their structure and paving the way for more effective solution strategies. His earlier erratum (2005, 46 citations) further refines the understanding of robot-packable and orthogonal variants, correcting and clarifying the foundational algorithm proposed by Martello et al. (2000). Through these contributions, Den Boef has significantly advanced both the theoretical and practical aspects of packing optimization, offering rigorous characterizations that help bridge the gap between computational hardness and real-world applicability. His work remains essential reading for researchers tackling logistics, manufacturing, and resource allocation challenges.