Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
暂无分享,去创建一个
Jeffrey D. Ullman | Ronald L. Graham | David S. Johnson | Michael Randolph Garey | Alan Demers | David S. Johnson | M. Garey | R. Graham | J. Ullman | A. Demers
[1] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[2] William L. Maxwell,et al. Theory of scheduling , 1967 .
[3] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[4] Nicos Christofides,et al. The Loading Problem , 1971 .
[5] Jeffrey D. Ullman,et al. Worst-case analysis of memory allocation algorithms , 1972, STOC.
[6] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[7] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..