Bin packing with items uniformly distributed over intervals [a,b]
暂无分享,去创建一个
[1] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.
[2] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[3] Walter Knödel,et al. A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit , 1981, MFCS.
[4] Richard M. Karp,et al. An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[5] Greg N. Frederickson,et al. Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms , 1980, Inf. Process. Lett..
[6] Micha Hofri,et al. A Stochastic Model of Bin-Packing , 1980, Inf. Control..
[7] Richard Loulou,et al. Probabilistic behaviour of optical bin-packing solutions , 1984 .
[8] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[9] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[10] Lisa D. Nicklas,et al. A parallel solution to the cutting stock problem for a cluster of workstations , 1996, Proceedings of 5th IEEE International Symposium on High Performance Distributed Computing.
[11] G. S. Lueker,et al. Bin packing can be solved within 1 + ε in linear time , 1981 .
[12] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..