On a dual version of the one-dimensional bin packing problem |
| |
Authors: | S. F. Assmann D. S. Johnson D. J. Kleitman J. Y. -T. Leung |
| |
Affiliation: | Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 USA;AT & T Bell Laboratories, Murray Hill, New Jersey 07974 USA;Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 USA;Northwestern University, Evanston, Illinois 60201 USA |
| |
Abstract: | The NP-hard problem of packing items from a given set into bins so as to maximize the number of bins used, subject to the constraint that each bin be filled to at least a given threshold, is considered. Approximation algorithms are presented that provide guarantees of , , and the optimal number, at running time costs of O(n), O(nlogn), and O(nlog2n), respectively, and the average case behavior of these algorithms is explored via empirical tests on randomly generated sets of items. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|