RECURSIVE ALGORITHMS FOR THE OPTIMUM CUTTING OF EQUAL RECTANGLES

Yaodong Cui, Tianlong Gu, and Wei Hu

References

  1. [1] P.K. Agrawal, Minimizing trim loss in cutting rectangular blanksof a single size form a rectangular sheet using orthogonalguillotine cuts, European Journal of Operational Research, 64(3),1993, 410–422.
  2. [2] Y. Cui & R. Zhou, Generating optimal cutting patterns forrectangular blanks of a single size, Journal of the OperationalResearch Society, 53(12), 2002, 1338–1346.
  3. [3] Y. Cui, Dynamic programming algorithms for the optimalcutting of equal rectangles, Applied Mathematical Modelling,29(11), 2005, 1040–1053.
  4. [4] A.G. Tarnowski, J. Terno, & G. Scheithauer, A polynomial timealgorithm for the guillotine pallet-loading problem, INFOR,32(4), 1994, 275–287.
  5. [5] M.Z. Arslanov, Continued fractions in optimal cutting of arectangular sheet into equal small rectangles, European Journalof Operational Research, 125(2), 2000, 239–248.
  6. [6] D. Fayard & V. Zissimopoulos, An approximation algorithmfor solving unconstrained two-dimensional knapsack problems,European Journal of Operational Research, 84(3), 1995, 618–632.
  7. [7] M. Hifi, Exact algorithms for large-scale unconstrained two andthree staged cutting problems, Computational Optimization andApplications, 18(1), 2001, 63–88.
  8. [8] M. Hifi & R.M. Hallah, Strip generation algorithms for con-strained two-dimensional two-staged cutting problems, EuropeanJournal of Operational Research, 172(2), 2006, 515–527.
  9. [9] Y.G. G, Y.J. Seong, & M.K. Kang, A best-first branch and boundalgorithm for unconstrained two-dimensional cutting problems,Operations Research Letters, 31(4), 2003, 301–307.

Important Links:

Go Back