3D Bin Packing | Papers With Code
Jun 26, 2020 · As a classic NP-hard problem, the bin packing problem (1D-BPP) seeks for an assignment of a collection of items with various weights to bins. The optimal assignment houses all the items with the fewest bins such that the total weight of items in a bin is below the bin’s capacity. In its 3D version (3D-BPP), an item has a 3D “weight” corresponding to its length, width and height.
DA: 28 PA: 77 MOZ Rank: 42 Up or Down: Up