1. A hybrid improvement heuristic for the one-dimensional bin packing problem;Alvim;J Heurist,2004
2. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting;Belov;Eur J Oper Res,2006
3. Brandão, F, Pedroso JP. Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression. Technical Report DCC-2013-08, Faculdade de Ciências da Universidade do Porto, Portugal; 2013.
4. Lower bounds and algorithms for the 2-dimensional vector packing problem;Caprara;Discrete Appl Math,2001
5. ESICUP, 2013. Euro Especial Interest Group on Cutting and Packing. One Dimensional Cutting and Packing Data Sets. http://paginas.fe.up.pt/esicup/tiki-list_file_gallery.php?galleryId=1.