A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
暂无分享,去创建一个
[1] Sharat Israni,et al. Two-dimensional cutting stock problem research: A review and a new rectangular layout algorithm , 1982 .
[2] Micha Hofri. Two-Dimensional Packing: Expected Performance of Simple Level Algorithms , 1980, Inf. Control..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Chak-Kuen Wong,et al. Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation , 1975, SIAM J. Comput..
[5] Greg N. Frederickson,et al. Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms , 1980, Inf. Process. Lett..
[6] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[7] Brenda S. Baker,et al. A 5/4 Algorithm for Two-Dimensional Packing , 1981, J. Algorithms.
[8] Jr. E. G. Coffman. An Introduction to Combinatorial Models of Dynamic Storage Allocation , 1983 .
[9] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .