Jan Korst

Papers

Total Citations

140

H-Index

About

Jan Korst is a leading researcher in combinatorial optimization, with a primary focus on packing and scheduling problems. His major contributions lie in the theory and algorithms for three-dimensional bin packing, a notoriously difficult NP-hard problem with practical applications in logistics and manufacturing. His most-cited work, "Algorithm 864" (2007, 94 citations), tackles the challenge of orthogonally packing rectangular boxes into the minimum number of bins, characterizing relevant subclasses and presenting powerful solution methods. Korst further refined the understanding of this domain in his erratum (2005, 46 citations) to the seminal work on the three-dimensional bin packing problem, where he critically analyzed and corrected the characterization of exact algorithms, including those by Martello et al. This meticulous work has shaped how researchers approach robot-packable and orthogonal variants. Beyond packing, Korst has made significant strides in scheduling theory, particularly for resource-constrained environments. His research is distinguished by its blend of rigorous theoretical analysis and practical algorithm design, making complex industrial problems tractable and influencing subsequent work in operations research and computer science.