2 papers
cs.DS2026
Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
Renan Fernando Franco da Silva, Vinícius Loti de Lima, Rafael C. S. Schouery +2
The Cutting Stock Problem (CSP) and Bin Packing Problem (BPP) are classical combinatorial optimization problems extensively studied since the 1960s. State-of-the-art exact algorith…
math.OC2019
A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem
Jean-François Côté, Mohamed Haouari, Manuel Iori
The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel t…