Binpack: Common bin packing heuristics

[ algorithms, bsd3, heuristics, library ] [ Propose Tags ]

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.

Versions 0.3, 0.3.1, 0.4, 0.4.1
Change log NEWS
Dependencies base (>=3 && <5), haskell98, QuickCheck [details]
License BSD-3-Clause
Author Björn B. Brandenburg
Maintainer bbb@cs.unc.edu
Category Algorithms, Heuristics
Uploaded by BjoernBrandenburg at Tue Aug 4 17:36:18 UTC 2009
Distributions NixOS:0.4.1
Downloads 3009 total (18 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees