The Binpack package

[Tags:bsd3, library]

An implementation of the first-fit, modified-first-fit, last-fit, best-fit, sum-of-squares-fit, worst-fit, and almost-last-fit bin packing heuristics. Items can be packed in order of both decreasing and increasing size (and, of course, in unmodified order).

The module supports both the standard (textbook) minimization problem (How many bins do I need?) and the more practical fitting problem (I've got n bins; which items can I take?).

The API is simple and the module is documented with Haddock (complete with examples). The implementation of the above-mentioned heuristics is complete and partially tested with QuickCheck. However, note that speed has not been a primary concern to date.

Patches and feedback are very welcome.


Versions 0.3, 0.3.1, 0.4, 0.4.1
Change log NEWS
Dependencies base (>=3 && <5) [details]
License BSD3
Author Björn B. Brandenburg
Stability Unknown
Category Algorithms, Heuristics
Uploaded Fri Feb 7 13:32:35 UTC 2014 by DavidFeng
Distributions NixOS:0.4.1
Downloads 1487 total (10 in the last 30 days)
0 []
Status Docs available [build log]
Successful builds reported [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees