Introduction - If you have any usage issues, please Google them yourself
Classic one-dimensional bin-packing problem (Bin Packing Problem) means that a given sequence of items, item size, request these items into one unit of capacity of the box, making the items for each box size and non- more than one, and the number used in the smallest box.
Packet : 7941931box.rar filelist
16-3\box.c
16-3\data1
16-3\readme.txt
16-3