Large-scale optimization methods applied to the cutting stock problem of irregular shapes

References

• ALBANO , A. and SAPPUPO , G. , 1980 , Optimal allocation of two-dimentional irregular shapes using heuristic search method . IEEE Transactions on Systems, Man and Cybernetics , 10 , 242 .
   Web of Science ®Google Scholar
• BAZARAA , M. S. , JAR VIS , J. J. and SHERALI , H. D. , 1990 , Linear Programming and Network Flows ( John Wiley ).
   Google Scholar
• CHVATAL , V. , 1983 , Linear Programming ( W. H. Freeman ).
   Google Scholar
• DOBSON , G. , 1982 , Worst-case analysis of greedy heuristics for integer programming with nonnegative data . Mathematics of Operations Research , 7 , 515 .
   Web of Science ®Google Scholar
• DYCKHOFF , H. ,WASCHER, G. (eds), 1990 , Special issue cutting and packing . European Journal of Operational Research , 44 ( 2 ).
   Web of Science ®Google Scholar
• GILMORE , P. C. and GOMORY , R. E. , 1961 , A linear programming approach to the cutting-stock problem . Operations Research , 9 , 849 .
   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 , 863 .
   Web of Science ®Google Scholar
• KARMARKER , N. K. , 1984 , A new polynomial time algorithm for linear programming . Combinatorica , 4 , 373 – 395 .
   Web of Science ®Google Scholar
• MURTY , K. G. , 1983 , Linear Programming ( Chichester John Wiley ).
   Google Scholar
• Qu , W. and SANDERS , J. L. , 1987 , A nesting algorithm for irregular parts and factors affecting trim loss . International Journal of Production Research , 25 , 381 .
   Web of Science ®Google Scholar