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 [faq] 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
Category Algorithms, Heuristics
Uploaded by BjoernBrandenburg at 2009-08-04T07:14:37Z
Distributions NixOS:0.4.1
Downloads 4588 total (16 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees