1. Belov, G., Scheithauer, G.: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur. J. Oper. Res. 171(1), 85–106 (2006)
2. Ben Amor, H., Desrosiers, J., De Carvalho, J.M.V.: Dual-optimal inequalities for stabilized column generation. Opns. Res. 54(3), 454–463 (2006)
3. Jr Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems. Pws Publishing Company, Pacific Grove (1997)
4. Jr Coffman, E.G., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Du, D.-Z., Pardalos, P.M., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, 2nd edn. Springer, New York (2013)
5. De Carvalho, J.M.V.: Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Opns. Res. 86, 626–659 (1999)