Unconstrained Knapsack Library

Library with various solutions (optimal and approximations) for the unconstrained knapsack problem

Unconstrained Knapsack Problem

The unconstrained knapsack problem is a version of the knapsack problem where there is no constraint on the weight. Therefore, at the very least we have a bi-objective problem where we try to minimize the weight and maximize the profit.

Building the project

Create a _build directory: mkdir _build
Go to the _build directory: cd _build
Run cmake: cmake ..
Run make install: make install
Library will be located on the _install folder, to go there: cd ../_install if you are still on the _build folder