1 |
C. H. Cheng, B. R. Feiring, and T. C. E. Cheng, "The cutting stock problem-a survey," International Journal of Production Economics, vol. 36, no. 3, pp. 291-305, 1994.
DOI
|
2 |
P. E. Sweeney and E. R. Paternoster, "Cutting and packing problems: a categorized, application-orientated research bibliography," Journal of the Operational Research Society, vol. 43, no. 7, pp. 691-706, 1992.
DOI
|
3 |
R. Baldacci and M. A. Boschetti, "A cutting-plane approach for the two-dimensional orthogonal nonguillotine cutting problem," European Journal of Operational Research, vol. 183, no. 3, pp. 1136-1149, 2007.
DOI
|
4 |
P. C. Gilmore and R. E. Gomory, "Multistage cutting stock problems of two and more dimensions," Operations Research, vol. 13, no. 1, pp. 94-120, 1965.
DOI
|
5 |
J. Ji, Y. P. Lu, J. Z. Cha, J. Q. Yu, and Y. D. Cui, "An exact algorithm for large-scale unconstrained three staged cutting problems with same-size block requirement," International Journal of Information and Management Sciences, vol. 23, no. 1, pp. 59-78, 2012.
|
6 |
M. Hifi, "Exact algorithms for large-scale unconstrained two and three staged cutting problems," Computational Optimization and Applications, vol. 18, no. 1, pp. 63-88, 2001.
DOI
|
7 |
Y. Cui, "Generating optimal T-shape cutting patterns for rectangular blanks," Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, vol. 218, no. 8, pp. 857-866, 2001
DOI
|
8 |
P. C. Gilmore and R. E. Gomory, "A linear programming approach to the cutting stock problem-Part II," Operations Research, vol. 11, no. 6, pp. 863-888, 1963.
DOI
|
9 |
J. E. Beasley, "Algorithms for unconstrained two-dimensional guillotine cutting," Journal of the Operational Research Society, vol. 36, no. 4, pp. 297-306, 1985.
DOI
|
10 |
J. C. Herz, "Recursive computational procedure for two-dimensional stock cutting," IBM Journal of Research and Development, vol. 16, no. 5, pp. 462-469, 1972.
DOI
|
11 |
M. Hifi and V. Zissimopoulos, "A recursive exact algorithm for weighted two-dimensional cutting," European Journal of Operational Research, vol. 91, no. 3, pp. 553-564, 1996.
DOI
|
12 |
G. Young-Gun, Y. J. Seong, and M. K. Kang, "A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems," Operations Research Letters, vol. 31, no. 4, pp. 301-307, 2003.
DOI
|
13 |
J. V. De Carvalho, "LP models for bin packing and cutting stock problems," European Journal of Operational Research, vol. 141, no. 2, pp. 253-273, 2002.
DOI
|
14 |
Y. Cui, D. He, and X. Song, "Generating optimal two-section cutting patterns for rectangular blanks," Computers & Operations Research, vol. 33, no. 6, pp. 1505-1520, 2006.
DOI
|
15 |
R. Alvarez-Valdes, F. Parreno, and J. M. Tamarit, "A tabu search algorithm for a two-dimensional non-guillotine cutting problem," European Journal of Operational Research, vol. 183, no. 3, pp. 1167-1182, 2007.
DOI
|