1 |
G. Wascher, H. Hausner, and H. Schumann, "An improved typology of cutting and packing problems", Eur J Oper Res., Vol. 183, pp.1109-1130, 2007.
DOI
|
2 |
P. C. Gilmore, and R. E. Gomory, "A linear programming approach to the cutting stock problem-partII", Oper Res., Vol. 11, pp.863-888, 1963.
DOI
|
3 |
P. C. Gilmore, and R. E. Gomory, "A linear programming approach to the cutting stock problem", Oper Res., Vol. 9, pp.849-859, 1961.
DOI
|
4 |
M. Gradisar, and P. Trkman, "A combined approach to the solution to the general one-dimensional cutting stock problem", Comput. Oper Res., Vol. 32, pp.1793-1807, 2005.
DOI
|
5 |
S. Umetani, M. Yagiura, and T. Ibaraki, "One-dimensional cutting stock problem to minimize the number of different patterns", Eur J Oper Res., Vol. 146, pp.388-402, 2003.
DOI
|
6 |
P. C. Gilmore, and R. E. Gomory, "Multistage cutting stock problems of two and more dimensions", Oper Res., Vol. 13, pp.94-120, 1965.
DOI
|
7 |
M. Hifi, "An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock", Comput. Oper Res., Vol. 24, pp.727-36, 1997.
DOI
|
8 |
F. Vanderbeck, "A nested decomposition approach to a three-stage, two dimensional cutting-stock problem", Manag. Sci., Vol. 47, pp.864-79, 2001.
DOI
|
9 |
E. K. Burke, G. Kendall, and G. Whitwell, "A new placement heuristic for the orthogonal stock cutting problem", Oper Res., Vol. 52, pp.655-71, 2004.
DOI
|
10 |
Ben Messaoud S, Chu C, and M. Espinouse, "Characterization and modelling of guillotine constraints", Eur J Oper Res., Vol. 191, pp.112-126, 2008.
DOI
|
11 |
J. E. Beasley, "An exact two-dimensional non-guillotine cutting tree search procedure", Oper Res., Vol. 33, pp.49- 64, 1985.
DOI
|
12 |
M. Gradisar, J. Jesenko, and C. Resinovic, "Optimization of roll cutting in clothing industry", Comput. Oper Res., Vol. 24, pp.945-953, 1997.
DOI
|
13 |
A. Abuabara, and R. Morabito, "Cutting optimization of structural tubes to build agricultural light aircrafts", Ann Oper Res., Vol. 169, pp.149-165, 2009.
DOI
|
14 |
S. Koch, S. Konig, and G. Wscher, "Integer linear programming for a cutting problem in the wood-processing industry: a case study", Int Trans Oper Res., Vol. 16, pp.715-726, 2009.
DOI
|
15 |
Y. G. G, and M. K. Kang, "A fast algorithm for two-dimensional pallet loading problems of large size", Eur J Oper Res., Vol. 134, pp.193-202, 2001.
DOI
|
16 |
Z. Degraeve, and L. Schrage, "Optimal Integer Solutions to Industrial Cutting Stock Problems", INFORMS J Comput., Vol. 11, pp.406-419, 1999.
DOI
|
17 |
R. D. Tsai, E. M. Malstrom, and H. D. Meeks., "A twodimensional palletizing procedure for warehouse loading operations", IIE Trans., Vol. 20, pp.418-425, 1988.
DOI
|
18 |
T. W. Leung, C. H. Yung, and M. D. Troutt, "Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem", Comput. Ind Eng., Vol. 40, pp.201-214, 2001.
DOI
|
19 |
A. Bortfeldt, and T. Winter, "A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces", Int Trans Oper Res., Vol. 16, pp.685-713, 2009.
DOI
|
20 |
J. F. Tsai, P. L. Hsieh, and Y. H. Huang, "An optimization algorithm for cutting stock problems in the TFT-LCD industry", Comput. Oper Res., Vol. 57, pp.913-919, 2009.
|
21 |
H. C. LU, and Y. H. Huang, "An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry", Eur J Oper Res., Vol. 246, pp.51- 66, 2015.
DOI
|
22 |
J. F. Gonçalves, and M. G. C. Resende, "A hybrid heuristic for the constrained two-dimensional non-guillotine orthogonal cutting problem", Tech Rep., AT&T Labs Research, Florham Park, NJ, 2006.
|