A linear time bin-packing algorithm

Authors:
Charles U Martel
Affiliations:
Computer Science Division, University of California, Davis, CA 95616, USA
Venue:
Operations Research Letters
Year:
1985

Citing 4
Cited 2

New Algorithms for Bin Packing

Journal of the ACM (JACM)
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice
Time bounds for selection

Journal of Computer and System Sciences
Fast algorithms for bin packing

Journal of Computer and System Sciences

Note: A note on the minimum bounded edge-partition of a tree

Discrete Applied Mathematics
Linear time-approximation algorithms for bin packing

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the bin-packing problem a list L of numbers in (0, 1] is to be packed into unit capacity bins. Let L^* denote the minimum number of bins required. We present a linear time bin-packing algorithm for the off-line version of this problem. The algorithm uses at most 43 L* + 2 bins.