Approximation Algorithms for Bin Packing Problems: A Survey
暂无分享,去创建一个
[1] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[2] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[3] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[4] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..
[5] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[6] M. T. Kaufman,et al. An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem , 1974, IEEE Transactions on Computers.
[7] Daniel J. Kleitman,et al. An optimal bound for two dimensional bin packing , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[8] Chak-Kuen Wong,et al. The Effect of a Capacity Constraint on the Minimal Cost of a Partition , 1975, JACM.
[9] Herb Schwetman,et al. Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems , 1975, JACM.
[10] Paul Erdös,et al. On Packing Squares with Equal Squares , 1975, J. Comb. Theory, Ser. A.
[11] Chak-Kuen Wong,et al. Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation , 1975, SIAM J. Comput..
[12] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.
[13] George Markowsky,et al. Multidimensional Bin Packing Algorithms , 1977, IBM J. Res. Dev..
[14] Edward G. Coffman,et al. An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..
[15] D. K. Friesen,et al. Sensitivity Analysis for Heuristic Algorithms , 1978 .
[16] Chak-Kuen Wong,et al. Bin Packing with Geometric Constraints in Computer Network Design , 1978, Oper. Res..
[17] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[18] Donna J. Brown,et al. A Lower Bound for On-Line One-Dimensional Bin Packing Algorithms. , 1979 .
[19] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.
[20] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..
[21] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..
[22] Edward G. Coffman,et al. A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing , 1981 .