IDENTIFYING ALTERNATE OPTIMAL SOLUTIONS TO THE DESIGN APPROXIMATION PROBLEM IN STOCK CUTTING

References

• Aggarwal , A. , Booth , H. , O'Rourke , J. , Suri , S. and Yap , C. K. 1989 . Finding Minimal Convex Nested Polygons . Information and Computation , 83 ,( 1 ), 98 – 110 .
   Web of Science ®Google Scholar
• Bhadury , J. and Chandrasekaran , R. 1995 . Stock cutting or complicated designs by computing Minimal Nested Polygons . Engineering Optimization , 25 , 165 – 178 .
   Web of Science ®Google Scholar
• Chandm , V. , Ghosh, S. K... Maheshwari , A. , Rajan , V. T. and Saluja , S. 1995 . NC-algorithms for minimum link path and related problems . Journal of Algorithms , 19 ,( 2 ), 173 – 205 .
   Google Scholar
• Chauny , F. and Loulou , R. 1994 . LP-based method for the muti-sheet cutting stock problem . INFOR , 32 ,( 4 ), 253 – 264 .
   Web of Science ®Google Scholar
• Christofides , N. and Whitlock , C. 1977 . An algorithm for two dimensional cutting problems . Operations Research , 25 , 30 – 44 .
   Web of Science ®Google Scholar
• De Carvalho , J. M. V. and Rodrigues , A. J. G. 1994 . A computer based interactive approach to a two-stage cutting stock problem . INFOR , 32 ,( 4 ), 243 – 252 .
   Web of Science ®Google Scholar
• Dori , B. and Ben-Assat , M. 1983 . Circumscribing a convex polygon by a polygon of fewer sides with minimum area addition . Computer Vision, Graphics and Image Processing , 24 , 131 – 159 .
   Google Scholar
• Ghosh, S. K.. and Maheshwari , A. 1990 . Optimal algorithm for computing Minimal Nested Non-convex Polygon . Information Processing Letters , 36 , 277 – 280 .
   Google Scholar
• Gilmore , P. C. and Gomory , R. E. 1961 . A linear programming approach to the cutting stock problem . Operations Research , 9 ,( 6 ), 849 – 859 .
   Web of Science ®Google Scholar
• Gilmore , P. C. and Gomory , R. E. 1963 . A linear programming approach to the cutting stock problem-Part II . Operations Research , 11 ,( 6 ), 863 – 888 .
   Web of Science ®Google Scholar
• Suri , S. and O'Rourke , J. 1985 . Finding Minimal Nested Polygons . Tech. Report , The Johns Hopkins University .
   Google Scholar
• Venkateswarlu , P. and Martyn , C. W. 1992 . The trim-loss problem in a wooden drum industry . OR-92 Proceedings of the Convention of Operational Research Society of India .
   Google Scholar