The skiving stock problem as a counterpart of the cutting stock problem
暂无分享,去创建一个
[1] E. Balas,et al. Set Partitioning: A survey , 1976 .
[2] Gerhard J. Woeginger,et al. A polynomially solvable special case of the unbounded knapsack problem , 2001, Oper. Res. Lett..
[3] Guntram Scheithauer,et al. The modified integer round-up property of the one-dimensional cutting stock problem , 1995 .
[4] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[5] Odile Marcotte. The cutting stock problem and integer rounding , 1985, Math. Program..
[6] Claudio Arbib,et al. Cutting and Reuse: An Application from Automobile Component Manufacturing , 2002, Oper. Res..
[7] Eugene J. Zak. Row and column generation technique for a multistage cutting stock problem , 2002, Comput. Oper. Res..
[8] E. H. Smith. A Bound on the Ratio between the Packing and Covering Densities of a Convex Body , 2000, Discret. Comput. Geom..
[9] Mihalis Yannakakis,et al. Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing , 2002, SIAM Rev..
[10] Gilbert Laporte,et al. An exact algorithm for the dual bin packing problem , 1995, Oper. Res. Lett..
[11] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[12] Thomas L. Saaty,et al. Reflections and Projections on Creativity in Operations Research and Management Science: A Pressing Need for a Shift in Paradigm , 1998, Oper. Res..
[13] M. P. Johnson,et al. Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry , 1997, SIAM Rev..