https://github.com/pwalig/ok_projekt

Solver for Multiple Knapsack Problem Variations
https://github.com/pwalig/ok_projekt

Last synced: 20 days ago
JSON representation

Solver for Multiple Knapsack Problem Variations

• Host: GitHub
• URL: https://github.com/pwalig/ok_projekt
• Owner: pwalig
• Created: 2023-11-28T19:57:40.000Z (12 months ago)
• Default Branch: main
• Last Pushed: 2023-12-16T23:00:17.000Z (11 months ago)
• Last Synced: 2023-12-17T23:28:13.675Z (11 months ago)
• Language: C++
• Size: 337 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 13
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# OK_Projekt

Solver for multiple Knapsack Problem variants

## Status

project in development

### Done so far

- Brute Force Methods

- Primitive Branch and Bound Methods

- Greedy algorithms

- Dynamic Programming

- measure calculation time

- json format support

### To Do

- Heuristics

- Multi threading

- GPU support

## Problems

- 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](https://en.wikipedia.org/wiki/Knapsack_problem)

- [Multi Dimentional Knapsack Problem](https://en.wikipedia.org/wiki/Knapsack_problem#Multi-dimensional_knapsack_problem)

## Using

- C++ language

- [nlohmann/json](https://github.com/nlohmann/json) JSON parser for Modern C++

## Requirements

- C++17 standard or more recent