Heuristic evaluation techniques for bin packing approximation algorithms. (English) Zbl 0604.68047


68Q25 Analysis of algorithms and problem complexity
68W99 Algorithms in computer science
Full Text: DOI


[1] A. Aiello, E. Burattini, A. Massarotti, F. Ventriglia,A posteriori evaluation of bin packing approximation algorithms, Discrete Appl. Math. 2 (1980) 159–161. · Zbl 0434.68052
[2] S.A. Cook,The complexity of theorem proving procedures, Proc. 3rd Annual ACM Symp. on the Theory of Comp. 1971, 151–158. · Zbl 0253.68020
[3] D.S. Johnson,Near-optimal bin packing algorithms, Doctoral Thesis, Mass. Inst. of Tech., Cambridge, Mass., 1973.
[4] D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, R.L. Graham Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput.3 (4), Dec. 1974. · Zbl 0297.68028
[5] R.M. Karp,Reducibility among combinatorial problems, Complexity of Computer Computations, R.E. Miller & J.W. Thatcher eds., Plenum Press, New York 1972, 85–104.
[6] M.R. Garey, D.S. Johnson,Computers and intractability, W.H. Freeman & Co., San Francisco, 1979.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.