1. Computers and intractability: a guide to the theory of NP-completeness;Garey,1979
2. Efficient lower bounds and heuristics for the variable cost and size bin packing problem;Crainic;Comput Oper Res,2011
3. Packing problems in transportation and supply chain: new problems and trends;Perboli;Proc: Soc Behav Sci,2014
4. An improved typology of cutting and packing problems;Wäscher;Eur J Oper Res,2007
5. Schoenfield JE. Fast exact solution of open bin packing problems without linear programming. Draft, US Army Space & Missile Defense Command, Huntsville, Alabama, USA; 2002.