The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems

Beasley, 1985, An exact two-dimensional nonguillotine cutting tree search procedure, Operations Research, 33, 49, 10.1287/opre.33.1.49 Beasley, 1985, Algorithms for unconstrained two-dimensional guillotine cutting, Journal of the Operational Research Society, 36, 297, 10.1057/jors.1985.51 Chen, 1990, Pipeline architectures for dynamic programming algorithms, Parallel Computing, 13, 111, 10.1016/0167-8191(90)90124-R Christofides, 1977, An algorithm for two-dimensional cutting problems, Operations Research, 25, 31, 10.1287/opre.25.1.30 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 Gilmore, 1965, Multistage cutting problems of two and more dimensions, Operations Research, 13, 94, 10.1287/opre.13.1.94 Gilmore, 1966, The theory and computation of knapsack functions, Operations Research, 14, 1045, 10.1287/opre.14.6.1045 Herz, 1972, A recursive computing procedure for two-dimensional stock cutting, IBM Journal of Research and Development, 16, 462, 10.1147/rd.165.0462 Hifi, 1994, Study of some combinatorial optimization problems: Cutting stock, rectangular packing and set covering problems Hifi, 1995, Une amélioration de I'algorithme récursif de Herz pour la résolution du problème de découpe à deux dimensions, RAIRO, Operations Research, 29, 1 Kantorovich, 1960, Mathematical methods of organizing and planning production, Management Science, 6, 363, 10.1287/mnsc.6.4.366 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 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 Rinnooy Kan, 1987, Nonorthogonal two-dimensional cutting patterns, Management Science, 33, 670, 10.1287/mnsc.33.5.670 Syslo, 1983 Toth, 1980, Dynamic programming algorithms for zero-one knapsack problem, Computing, 25, 29, 10.1007/BF02243880 Vasko, 1989, A computational improvement to Wang's two-dimensional cutting stock algorithm, Computers and Industrial Engineering, 16, 109, 10.1016/0360-8352(89)90013-2 Viswanathan, 1993, Best-first search methods for constrained two-dimensional cutting stock problems, Operations Research, 41, 768, 10.1287/opre.41.4.768 Wang, 1983, Two algorithms for constrained two-dimensional cutting stock problems, Operations Research, 31, 573, 10.1287/opre.31.3.573 Zissimopoulos, 1984, Heuristic methods for solving (un)constrained two-dimensional cutting stock problems, Methods of Operations Research, 49, 345