Algorithms for the bin packing problem with overlapping ...
Jan 01, 2018 · We study an extension of the bin packing problem, where packing together two or more items may make them occupy less volume than the sum of their individual sizes. To achieve this property, an item is defined as a finite set of symbols from a given alphabet. Unlike the items of B in P acking, two such sets can share zero, one or more symbols.
DA: 100 PA: 10 MOZ Rank: 55 Up or Down: Up