|Ratings|| ||Unique User Downloads|| ||Download Rankings|
|Not enough user ratings||Total: 1,205 ||All time: 3,144 This week: 380|
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.
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.
||Applications that use this package
No pages of applications that use this class were specified.
If you know an application of this package, send a message to the author to add a link here.