Evaluator for Knapsack problem for course MI-PAA (Problems and Algorithms).
It contains implementation of following algorithms:
- Brute force
- Brute force with Branch&Bound optimization
- Simple heuristic (price/weight ratio)
- Dynamic programming - decomposition by capacity
- Dynamic programming - decomposition by cost
- FPTAS
Also additional utilities:
- table exporter for wiki format
- graph exporter for simple data visualization (limited)