CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem

[1]  L. V. Kantorovich,et al.  Mathematical Methods of Organizing and Planning Production , 1960 .

[2]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[3]  John F. Pierce.  Some large-scale production scheduling problems in the paper industry , 1964 .

[4]  David W. Hutchinson.  A new uniform pseudorandom number generator , 1966, CACM.

[5]  A. R. Brown.  Optimum packing and depletion: The computer in space - and resource-usage problems , 1971 .

[6]  Linus Schrage,et al.  A More Portable Fortran Random Number Generator , 1979, TOMS.

[7]  Paul Bratley,et al.  A guide to simulation , 1983 .

[8]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[9]  S. K. Park,et al.  Random number generators: good ones are hard to find , 1988, CACM.

[10]  William H. Press,et al.  Book-Review - Numerical Recipes in Pascal - the Art of Scientific Computing , 1989 .

[11]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[12]  Hartmut Stadtler,et al.  A one-dimensional cutting stock problem in the aluminium industry and its solution , 1990 .

[13]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[14]  Peter Freebody,et al.  Research report No. 10 , 1991 .

[15]  Christopher O'Brien,et al.  Production research: approaching the 21st century , 1991 .

[16]  Paul E. Sweeney,et al.  Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .

[17]  Harald Dyckhoff,et al.  Cutting and Packing in Production and Distribution , 1992 .