This repository contains several (anytime) algorithms to solve the
Multi-Objective Binary Knapsack Problem (MOBKP). It is made up of a solver
mobkp, which can be found on the apps/ directory, and an header only
library under the namespace mobkp, which can be found on the include/
directory.
This library depends on
- mooutils for multi-objective optimization utilities, such as quality indicators and solution sets.
- apm for a theoretical anytime performance model that guides one of the algorithms.
- glpk
- fmt
- CL11
- Boost
You can use cmake to compile/install the library and/or solver.