Author:
Tsai Russell D.,Malstrom Eric M.,Kuo Way
Publisher
Springer Berlin Heidelberg
Reference40 articles.
1. Baker, B.S., D.J. Brown, and H.P. Katseff, “A 5/4 Algorithm for Two-Dimensional Packing,” Journal of Algorithms, 2, No. 4, pp. 348-368 (1981).
2. Beasley, J.E., “Algorithms for Unconstrained Two-Dimensional Guillotine Cutting,” Journal of the Operational Research Society, 36, No. 4, pp. 297–306 (1985).
3. Beasley, J.E., “An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure,” Operations Research, 33, No. 1, pp. 49–64 (1985).
4. Beasley, J.E., “Bounds for Two-Dimensional Cutting,” Journal of the Operations Research Society, 36, No. 1, pp. 71–74 (1985).
5. Biro, M. and E. Boros, “Network Flows and Non-Guillotine Cutting Patterns,” European Journal of Operational Research, 16, No. 2, pp. 215–221 (1984).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献