Generating optimal two-section cutting patterns for rectangular blanks
Computers and Operations Research
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
Operations Research
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing
Computers and Operations Research
Simple block patterns for the two-dimensional cutting problem
Mathematical and Computer Modelling: An International Journal
Knowledge based approach to the cutting stock problem
Mathematical and Computer Modelling: An International Journal
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
Operations Research Letters
Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
A recursive algorithm is implemented to give high computational speeds in the solution of a cutting-stock problem. Optimal edge-to-edge cutting is shown to be achieved more easily by recursive programming than by conventional methods. The technique features preliminary discretization, which lowers the memory requirements in the computational procedure. A comparison is made between this recursive algorithm and two iterative algorithms previously given by Gilmore-Gomory. The limitations of the algorithms are discussed and some numerical results given.