1. Belov, G., 2003. Problems, Models and Algorithms in One- and Two-Dimensional Cutting. Technischen Universität Dresden.
2. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
3. A linear programming approach to the cutting stock problem;Gilmore;Operat. Res.,1961
4. A linear programming approach to the cutting stock problem, part II;Gilmore;Operat. Res.,1963
5. Knapsack Problems;Kellerer,2004