The Binpack package

[Tags: bsd3, library]

An implementation of the first-fit, modified-first-fit, last-fit, best-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.


Properties

Versions0.3, 0.3.1, 0.4, 0.4.1
Dependenciesbase (>=3 && <5), haskell98, QuickCheck
LicenseBSD3
AuthorBjörn B. Brandenburg
Maintainerbbb@cs.unc.edu
CategoryAlgorithms, Heuristics
UploadedTue Aug 4 17:36:18 UTC 2009 by BjoernBrandenburg
Downloads674 total (51 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees