Dynamic programming algorithms for the optimal cutting of equal rectangles
Author:
- 30 November 2005
- journal article
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 29 (11) , 1040-1053
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Generating optimal cutting patterns for rectangular blanks of a single sizeJournal of the Operational Research Society, 2002
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problemsComputers & Operations Research, 2002
- Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problemComputers & Industrial Engineering, 2001
- Continued fractions in optimal cutting of a rectangular sheet into equal small rectanglesEuropean Journal of Operational Research, 2000
- Constrained two‐dimensional cutting stock problems a best‐first branch‐and‐bound algorithmInternational Transactions in Operational Research, 2000
- An application of simulated annealing to the cutting stock problemEuropean Journal of Operational Research, 1999
- The cutting stock problem — a surveyInternational Journal of Production Economics, 1994
- Minimising trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cutsEuropean Journal of Operational Research, 1993
- Cutting and Packing Problems: A Categorized, Application-Orientated Research BibliographyJournal of the Operational Research Society, 1992
- A typology of cutting and packing problemsEuropean Journal of Operational Research, 1990