Bin packing problem
The
bin packing problem is a problem in
mathematics to ideally place objects of
n "length" into bins of
m "length", that is, to minimize the number of objects remaining after placing the objects.
See also
This article is a stub. You can help Wikipedia by fixing it.