Author:
Antonio J.,Chu C.,Sauer N.,Wolff P.
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Cheng, C.H., Feiring, B.R., Cheng, T.C.E.: The cutting stock problem — A survey. Int. J. Prod. Econ. 36 (1994), 291–305.
2. Corominas, A., Bautista, J.: Procedures for solving a 1-dimensional cutting problem. Europ. J. Oper. Res. 77 (1994), 154–168.
3. Garey, M.R., Johnson, D.S.: Approxaimation Algorithms for bin packing problems: A survey. In: Ausiello, G., Lucertini, M. (Eds): Analysis and design of algorithms in combinatorial optimization, Springer, 1981, 149–172.
4. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Oper. Res. 9 (1961), 849–859.
5. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem — Part II. Oper. Res. 11 (1963), 863–888.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献