pareto-front: Monoids for dealing with Pareto efficiency
Two monoids for finding either the Pareto efficient subset of a collection or splitting the collection into a series of Pareto fronts.
[Skip to Readme]
Downloads
- pareto-front-0.1.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1.0.0, 0.1.0.1 |
|---|---|
| Change log | ChangeLog.md |
| Dependencies | base (>=4.7 && <5) [details] |
| License | BSD-3-Clause |
| Copyright | 2022 Jeremy List |
| Author | Jeremy List |
| Maintainer | quick.dudley@gmail.com |
| Category | math |
| Home page | https://nest.pijul.com/quickdudley/pareto-front |
| Bug tracker | https://nest.pijul.com/quickdudley/discussions |
| Source repo | head: pijul clone https://nest.pijul.com/quickdudley/pareto-front |
| Uploaded | by quick_dudley at 2022-02-09T02:54:11Z |
| Distributions | NixOS:0.1.0.1 |
| Downloads | 166 total (0 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2022-02-09 [all 1 reports] |