diff options
Diffstat (limited to 'content/software')
-rw-r--r-- | content/software/index.md | 58 |
1 files changed, 58 insertions, 0 deletions
diff --git a/content/software/index.md b/content/software/index.md new file mode 100644 index 0000000..045624e --- /dev/null +++ b/content/software/index.md @@ -0,0 +1,58 @@ ++++ +title = "Software" ++++ + +### mooutils + + C++ library containing several utilities to aid in the + implementation of multi-objective optimization algorithms, such as: + quality indicators, dominance relations, sets of non-dominated + points/solutions, queues of solutions. + + [Github](https://github.com/adbjesus/mooutils), + [Zenodo](https://doi.org/10.5281/zenodo.6855878) + +### mobkp + + C++ library and solver for the multi-objective binary knapsack + problem, which includes several state of the art algorithms. + + [Github](https://github.com/adbjesus/mobkp), + [Zenodo](https://doi.org/10.5281/zenodo.6857685) + +### anytime + + R library to help analyze the anytime behavior of algorithms, which + provides several publication ready `ggplot2` plots, and a scalar + measure of anytime performance. + + [Github](https://github.com/adbjesus/anytime), + [Zenodo](https://doi.org/10.5281/zenodo.6856119) + +### nondLib + + C++ library for building and updatings sets of nondominated points, + providing several methods to filter the nondominated points from a + larger set, and a method to add nondominated points to a set. + + [Github](https://github.com/TLDart/nondLib), + [Zenodo](https://doi.org/10.5281/zenodo.4733026) + +### apm + + C++ library and binary for computing models of anytime + performance. Currently, it supports a theoretical model of anytime + performance for bi-objective anytime algorithms that find at each + iteration a solution to a bi-objective problem. + + [Github](https://github.com/adbjesus/apm), + [Zenodo](https://doi.org/10.5281/zenodo.6856094) + +### moco\_abm + + Rust library and binary to compute the ideal anytime behavior + theoretical model for bi-objective anytime algorithms that collect + an efficient solution at each iteration. + + [Github](https://github.com/adbjesus/moco_abm), + [Zenodo](https://doi.org/10.5281/zenodo.2551046) |