-
Notifications
You must be signed in to change notification settings - Fork 0
Home
Paweł Waligóra edited this page Dec 15, 2023
·
13 revisions
Note
Wiki is under construction.
Project aims to be a solver for multiple Knapsack Problem variants.
Code can be compiled with any C++ compiler that supports C++17 standard or newer,
Compilation command:
g++ -std=c++17 -g code/*cpp -o knapsack-solver.exe
Program should be run with parameters.
generic program call:
./knapsack-solver.exe [command] [positional arguments] [optional arguments]
For specific list of commands and arguments see commands page.
- Multi dimentional knapsack problem, but items are given as a graph, where each vertex in the graph is an item to pack. The problem is to find either path, cycle or tree in this graph, that fits in the knapsack and has maximum value.
- Knapsack Problem
- Multi Dimentional Knapsack Problem
- C++ language
- nlohmann/json JSON parser for Modern C++
- C++17 standard or more recent