David Pisinger

Papers

Total Citations

140

H-Index

About

David Pisinger is a leading figure in combinatorial optimization, with a primary focus on packing and cutting problems, knapsack problems, and large-scale integer programming. His most celebrated contributions lie in the notoriously difficult domain of three-dimensional bin packing, where he has developed both exact algorithms and sophisticated heuristic methods. His landmark paper, "Algorithm 864" (2007, 94 citations), provides a state-of-the-art exact algorithm for orthogonally packing rectangular boxes into the minimum number of bins—a problem that is NP-hard in the strong sense. This work, alongside his earlier erratum and characterization of the Martello et al. algorithm (2005, 46 citations), has fundamentally shaped how researchers approach these complex, real-world logistics and manufacturing challenges. Pisinger’s impact is measured not only in citations but in the practical applicability of his work, which has influenced operations research in areas from container loading to warehouse optimization. He is also widely recognized for his contributions to the knapsack problem literature and for developing efficient dynamic programming and branch-and-bound techniques that are now standard in the field.