Cutting and Reuse: An Application from Automobile Component Manufacturing
暂无分享,去创建一个
[1] Odile Marcotte. The cutting stock problem and integer rounding , 1985, Math. Program..
[2] Ellis Horowitz,et al. Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.
[3] François Vanderbeck,et al. Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..
[4] Pamela H. Vance,et al. Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..
[5] José M. Valério de Carvalho. A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems , 2002, Comput. Optim. Appl..
[6] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[9] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[10] Chengbin Chu,et al. Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems , 1999, Oper. Res..
[11] M. P. Johnson,et al. Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry , 1997, SIAM Rev..