 |
|
Innovation award
Nominee: 5x |
This class implements one dimensional bin packing algorithms.
It takes an array of values and can determine the next fit, first fit, best fit, worst fit.
The class also implements the Ant-Colony-Optimization bin-packing solver.
|
|
| Name: |
Bin packing |
| Base name: |
bin-packing |
| Description: |
Implementation of one dimensional bin packing |
| Version: |
0.1 |
| PHP version: |
3.0 |
| License: |
Free for non-commercial use |
| All time users: |
504 users |
| All time rank: |
4905 |
| Week users: |
6 users |
| Week rank: |
442  |
| |
|
October 2010
Number 6
Prize: One copy of DWebPro Standard License |
Bin packing is operation that consists in finding the optimal way to fit a list of packages of varied sizes in a minimal number of bins, usually having all bins with the same size.
This class can solve the bin packing problem for packages and bins defined just by one dimension.
Manuel Lemos |
| Not yet rated by the users |
| |
Applications that use this class |
|
|
No application links were specified for this class.
If you know an application of this package, send a message to the
author to add a link here.
| |
 Files |
|
|
Stumble It!
Bookmark in del.icio.us
Browse all classes by 
Support forum (2)
Blog
Latest changes
User ratings
Files
