A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
作者： A. A. Farley
关键词:
摘要: In LP problems with an extremely large number of possible structural variables, solution to optimality is not always required. A bound can be used terminate such LPs. Such a presented for class problem that includes most cutting stock formulations.
sci-hub.se 参考文章(3)
Nicos Christofides, Charles Whitlock, An Algorithm for Two-Dimensional Cutting Problems Operations Research. ,vol. 25, pp. 30- 44 ,(1977) , 10.1287/OPRE.25.1.30
P. C. Gilmore, R. E. Gomory, A Linear Programming Approach to the Cutting Stock Problem---Part II Operations Research. ,vol. 11, pp. 863- 888 ,(1963) , 10.1287/OPRE.11.6.863
P. C. Gilmore, R. E. Gomory, A Linear Programming Approach to the Cutting-Stock Problem Operations Research. ,vol. 9, pp. 849- 859 ,(1961) , 10.1287/OPRE.9.6.849