Optimal Integer Solutions to Industrial Cutting Stock Problems
暂无分享,去创建一个
[1] George L. Nemhauser,et al. Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..
[2] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[3] John J. Bartholdi,et al. A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering , 1981, Oper. Res..
[4] Odile Marcotte. The cutting stock problem and integer rounding , 1985, Math. Program..
[5] Harald Dyckhoff,et al. A New Linear Programming Approach to the Cutting Stock Problem , 1981, Oper. Res..
[6] Gerhard Wäscher,et al. CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem , 1995 .
[7] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[8] Odile Marcotte. An instance of the cutting stock problem for which the rounding property does not hold , 1986 .
[9] A. A. Farley. A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems , 1990, Oper. Res..
[10] Pamela H. Vance,et al. Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..