https://zhengzhong-you.github.io/tags/bin-packing/Recent content in Bin Packing on Zhengzhong Ricky YouHugo -- 0.147.2enTue, 15 Sep 2026 00:00:00 +0000https://zhengzhong-you.github.io/software/precpack/Tue, 15 Sep 2026 00:00:00 +0000https://zhengzhong-you.github.io/software/precpack/An efficient open-source exact solver for bin packing with generalized precedence constraints.https://zhengzhong-you.github.io/papers/precpack/Tue, 15 Sep 2026 00:00:00 +0000https://zhengzhong-you.github.io/papers/precpack/<p>Under review at <em>INFORMS Journal on Computing</em>.</p> <ul> <li>arXiv: <a href="https://arxiv.org/abs/2609.17368" target="_blank" rel="noopener noreferrer">2609.17368</a> </li> <li>Preprint: <a href="https://arxiv.org/pdf/2609.17368" target="_blank" rel="noopener noreferrer">PDF</a> </li> <li>Repository: <a href="https://github.com/Sunkanghong-Wang/PrecPack" target="_blank" rel="noopener noreferrer">GitHub</a> </li> </ul> <p>PrecPack is an open-source exact solver for bin packing with generalized precedence constraints, including assembly line balancing and precedence-constrained bin packing as special cases. It extends branch-bound-and-remember search to arbitrary nonnegative precedence weights, retaining restrictions that remain active across future bins. The solver combines dominance rules and conflict-aware lower bounds with optional root column generation, using fixed-point arithmetic to obtain numerically valid bounds. Its C++ implementation provides programming and command-line interfaces, independent solution checking, explicit termination statuses, and reproducible batch execution. Same-machine, single-threaded comparisons show improved solution times and more optimality proofs than leading source-available BBR implementations on classical assembly-line benchmarks. The core search requires no commercial optimization software.</p>