Approaches to the Cutting Stock Problem

Abstract In this paper, we survey various approaches to the cutting stock problem; available computational experience is discussed. The intention is to synthesize the considerable work that has been done on this problem. The different approaches studied will include column generation, zero-one programming, combinatorial heuristics, and subgradient optimization. Applications to related combinatorial optimization problems are mentioned.

[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]  O. Mangasarian.  Duality in nonlinear programming , 1962 .

[4]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[5]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[6]  George L. Nemhauser,et al.  Introduction To Dynamic Programming , 1966 .

[7]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[8]  Olvi L. Mangasarian,et al.  Nonlinear Programming , 1969 .

[9]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[10]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[11]  Nicos Christofides,et al.  The Loading Problem , 1971 .

[12]  A. M. Geoffrion.  Duality in Nonlinear Programming: A Simplified Applications-Oriented Development , 1971 .

[13]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[14]  Leon S. Lasdon,et al.  An Efficient Algorithm for Multi-Item Scheduling , 1971, Oper. Res..

[15]  M. Held,et al.  Large scale optimization and the relaxation method , 1972, ACM Annual Conference.

[16]  G. Nemhauser,et al.  Integer Programming , 2020 .

[17]  Jeffrey D. Ullman,et al.  Worst-case analysis of memory allocation algorithms , 1972, STOC.

[18]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[19]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[20]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[21]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[22]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[23]  Roy E. Marsten.  The Use of the Box Step Method in Discrete Optimization , 1975 .

[24]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

[25]  M. Wagner,et al.  Generalized Linear Programming Solves the Dual , 1976 .