Research ArticleOpen accessIn the keywordsHeuristic Placement Routines for Two-Dimensional Bin Packing ProblemL. Wong, L. S. LeeProblem statement: Cutting and packing (C and P) problems are optimization problems that are concerned in finding a good arrangement of multiple small items into one or more larger objects. Bin packing problem is a type of C AND P problems. Bin packing problem is an important industrial problem where the general objective is to reduce the production costs by … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 7,701 accessesView PDFCite