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.
C++ library and solver for the multi-objective binary knapsack problem, which includes several state of the art algorithms.
R library to help analyze the anytime behavior of algorithms, which
provides several publication ready
ggplot2 plots, and a scalar
measure of anytime performance.
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.
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.
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.