diff options
| author | Alexandre Jesus <adbjesus@gmail.com> | 2016-08-21 18:25:55 +0100 |
|---|---|---|
| committer | Alexandre Jesus <adbjesus@gmail.com> | 2016-08-21 18:25:55 +0100 |
| commit | 66cfb031dfa81fcb083335a709cb4bd561faccb2 (patch) | |
| tree | 27c2c6ee727fd7d9344f12b2d27beb958b1f017f | |
| download | libuknapsack-66cfb031dfa81fcb083335a709cb4bd561faccb2.tar.gz libuknapsack-66cfb031dfa81fcb083335a709cb4bd561faccb2.zip | |
Add readme
| -rw-r--r-- | README.md | 8 |
1 files changed, 8 insertions, 0 deletions
diff --git a/README.md b/README.md new file mode 100644 index 0000000..1e4bbb9 --- /dev/null +++ b/README.md @@ -0,0 +1,8 @@ +# 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. |