1. Aloisio A, Arbib C, Marinelli F. On LP relaxations for 1-dimensional cutting stock with setup costs. Technical Report, Dipartimento di Informatica, Università degli Studi dell’Aquila, via Vetoio, Coppito, L’Aquila, Italy; 2006.
2. Aloisio A, Arbib C, Marinelli F. Cutting stock with no three parts per pattern: work-in-process and pattern minimization. Technical Report, Dipartimento di Informatica, Università degli Studi dell’Aquila, via Vetoio, Coppito, L’Aquila, Italy; 2008.
3. A branch-and-price-and-cut algorithm for the pattern minimization problem;Alves;RAIRO Operations Research,2008
4. Belov G. Problems, models and algorithms in one- and two-dimensional cutting. PhD thesis, Dresden University; 2003.
5. A simulated annealing heuristic for the one-dimensional cutting stock problem;Chen;European Journal of Operational Research,1996