Description: 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.
- [04722-x] - Data structure- C language version of ma
- [waveconvert] - WAV sound file conversion tool (PCM- ADP
- [LimitBin] - packing problem : packing problems, ther
- [SmallBall] - Matlab achieve a small ball of the sourc
- [cut] - Based on Variable Length Coding for solv
- [fulltext] - A New Heuristic Algorithm for the 3D Bin
- [20070903] - Three-dimensional bin-packing problem a
- [zdf] - Three-dimensional bin-packing problem of
- [PPD] - Packing using FFD algorithm programming
- [TSpack.tar] - stribution package of TSpack code.. for
File list (Check if you may need any files):
Download