1. C. Alves,Cutting and packing: problems, models and exact algorithms. Ph.D. Thesis, Universidade do Minho (2005).
2. J.M. Allwood and C.N. Goulimis.Reducing the number of patterns in one-dimensional cutting stock problems. Technical report, Electrical Engineering Department, Imperial College, London (1988).
3. G. Belov.Problems, models and algorithms in one- and two- dimensional cutting. Ph.D. Thesis, Dresden University (2003).
4. C.-L.S. Chen, S.M. Hart, and W.M. Tham. A simulated annealing heuristic for the one-dimensional cutting stock problem.Eur. J. Oper. Res.93(1996) 522–535.
5. S. Fekete and J. Schepers. New classes of fast lower bounds for bin packing problems.Math. Program.91(2001) 11–31.