On a dual version of the one-dimensional bin packing problem
SF Assmann, DS Johnson, DJ Kleitman, JYT Leung - Journal of algorithms, 1984 - Elsevier
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
1 2, 2 3, and 3 4 the optimal number, at running time costs of O (n), O (nlogn), and O (nlog 2
n), respectively, and the average case behavior of these algorithms is explored via empirical
tests on randomly generated sets of items.
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
1 2, 2 3, and 3 4 the optimal number, at running time costs of O (n), O (nlogn), and O (nlog 2
n), respectively, and the average case behavior of these algorithms is explored via empirical
tests on randomly generated sets of items.
以上显示的是最相近的搜索结果。 查看全部搜索结果