A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

Fayard, 1998, An efficient approach for large-scale two-dimensional guillotine cutting stock problems, Journal of the Operational Research Society, 49, 1270, 10.1057/palgrave.jors.2600638

Beasley, 1985, Algorithms for unconstrained two-dimensional guillotine cutting, Journal of the Operational Research Society, 36, 297, 10.1057/jors.1985.51

Hifi, 1996, A recursive exact algorithm for weighted two-dimensional cutting, European Journal of Operational Research, 91, 553, 10.1016/0377-2217(95)00343-6

Christofides, 1977, An algorithm for two-dimensional cutting problems, Operations Research, 25, 30, 10.1287/opre.25.1.30

Viswanathan, 1993, Best-first search methods for constrained two-dimensional cutting stock problems, Operations Research, 41, 768, 10.1287/opre.41.4.768

Christofides, 1995, An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, European Journal of Operational Research, 83, 21, 10.1016/0377-2217(93)E0277-5

Hifi, 1997, An improvement of Viswanathan and Bagchi's exact algorithm for cutting stock problems, Computers & Operations Research, 24, 727, 10.1016/S0305-0548(96)00095-0

Hifi, 1997, Constrained two-dimensional cutting: an improvement of Chrisfofides and Whitlock's exact algorithm, Journal of Operational Research Society, 48, 324, 10.1057/palgrave.jors.2600364

Morabito, 1992, An and-or-graph approach for two-dimensional cutting problems, European Journal of Operational Research, 58, 263, 10.1016/0377-2217(92)90212-R

Fayard, 1995, An approximation algorithm for solving unconstrained two-dimensional knapsack problems, European Journal of Operational Research, 84, 618, 10.1016/0377-2217(93)E0221-I

Hifi, 1997, The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems, European Journal of Operational Research, 97, 41, 10.1016/S0377-2217(96)00060-4

Morabito, 1996, Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach, European Journal of Operational Research, 94, 548, 10.1016/0377-2217(95)00128-X

Wang, 1983, Two algorithms for constrained two-dimensional cutting stock problems, Operations Research, 31, 573, 10.1287/opre.31.3.573

Hifi, 1997, Best-first search and dynamic programming methods for cutting problems: the cases of one or more stock plates, Computers & Industrial Engineering, 32, 187, 10.1016/S0360-8352(96)00215-X

Martello, 1990

Feo, 1989, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters, 8, 67, 10.1016/0167-6377(89)90002-3

Feo, 1995, Greedy randomized adaptive search procedures, Journal of Global Oprimization, 2, 1

Glover, 1997

Herz, 1972, A recursive computing procedure for two-dimensional stock cutting, IBM Journal of Research Development, 16, 462, 10.1147/rd.165.0462

Hifi, 1996, Une amelioration de l'algorithme recursif de Herz por le probleme de decoupe a deux dimensions, RAIRO, 30, 111, 10.1051/ro/1996300201111

Oliveira, 1990, An improved version of Wang's algorithm for two-dimensional cutting problems, European Journal of Operational Research, 44, 256, 10.1016/0377-2217(90)90361-E

Tschöke S, Holthöfer N. A new parallel approach to the constrained two-dimensional cutting stock problem. Technical Report, University of Padeborn, D.C.S. 33095 Padeborn. Germany, 1996.

Cung, 2000, Constrained two-dimensional cutting stock problems. A best-first branch-and-bound algorithm, International Transactions in Operational Research, 7, 185, 10.1111/j.1475-3995.2000.tb00194.x