Reproduce “Entropic Column Generation and Lehmer Branch-and-Price for Bin Packing Problem” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Masoud Ataei
Lehmer branch-and-price (LBP) solves exact bin-packing and cutting-stock problems by representing bin weights with a smooth curve and using a slack identity to detect when an improving solution must be a perfect packing. It then applies combinatorial tests and search. On 500 constructed AI/ANI instances, LBP solved all 500, versus 430 for its engine alone; generality remains untested.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.