31(8), 1223–1243 (2004)Ĭui, Y., Yang, Y., Cheng, X., Song, P.: A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem. 191(1), 61–85 (2008)Ĭorreia, M.H., Oliveira, J.F., Ferreira, J.S.: Reel and sheet cutting at a paper mill. 63, 362–367 (1993)Ĭintra, G.F., Miyazawa, F.K., Wakabayashi, Y., Xavier, E.C.: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. 27(4), 949–957 (1976)Ĭhen, C.S., Sarin, S., Balasubramanian, R.: A mixed-integer programming model for a class of assortment problems. 7(1), 312–340 (1940)Ĭhambers, M.L., Dyson, R.G.: The cutting stock problem in the flat glass industry selection of stock sizes. 19, 253–261 (1985)īrooks, R.L., Smith, C.A.B., Stone, A.H., Tutte, W.T.: The dissection of rectangles into squares. Beasley, J.E.: An algorithm for the two-dimensional assortment problem.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |