Linear time-approximation algorithms for bin packing

Operations Research Letters

Volumn 26, Issue 5, 2000, Pages 217-222

  Zhang, Guochuan ^a   Cai, Xiaoqiang ^b   Wong, C K ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BINS; COMPUTATIONAL COMPLEXITY; PACKING;

ABSOLUTE WORST-CASE RATIO; LINEAR TIME ALGORITHM;

OPERATIONS RESEARCH;

EID: 0034204968     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00077-2     Document Type: Article

References (10)

1. Coffman E.G., Garey M.R., Johnson D.S. Approximation algorithms for bin packing: a survey. Hochbaum D. Approximation Algorithms for NP-Hard Problems. 1996;46-93 PWS Publishing Company, Boston.
2. Fernandez V.W., Lueker G.S. Bin packing can be solved within. 1+ε in linear time Combinatorica. 1:1981;349-355.
3. M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
4. D.S. Johnson, Near-optimal bin packing algorithms, Ph.D. Thesis, MIT, Department of Mathematics, Cambridge, 1973.
5. Johnson D.S., Demers A., Ullman J.D., Garey M.R., Graham R.L. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3:1974;256-278.
6. Lee C.C., Lee D.T. A simple online bin packing algorithm. J. Assoc. Comput. Mach. 32:1985;562-572.
7. J.K. Lenstra, D.B. Shmoys, Computing near-optimal schedules, in: P. Chretienne et al., (Eds.), Scheduling Theory and Its Application, Wiley, New York, 1995.
8. Martel C.U. A linear time bin-packing algorithm. Oper. Res. Lett. 4:1985;189-192.
9. Ramanan P., Brown D.J., Lee C.C., Lee D.T. On-line bin packing in linear time. J. Algorithms. 10:1989;305-326.
10. Simchi-Levi D. New worst-case results for the bin packing problem. Naval Res. Logist. 41:1994;579-585.