Multi-threaded Knapsack Solver - uses branch and bound and/or dynamic programming
KNAPSACKer is a universal toolset for solving different types of knapsack (0/1) problems, that is capable of statistical analysis and data visualization.
Efficient implementations of simple branch and bound and dynamic programming algorithms for 0-1 and unbounded Knapsack problems.
Multiple Disjunctively Constrained Knapsak problem: definition and an approximation algorithm implementation.
A small console application for optimally packing ones backpack. Written in May 2017 for a Code Competition sponsored by IT-Talents.de
Knap Sack Problem Backtracking
Solver for Multiple Knapsack Problem Variations
This is a knapsack-problem solver via Backtracking and Branch and Bound
Solver for unbounded and unweighted knapsack problems
Dynamic programming solution to the knapsack problem.
Add a description, image, and links to the knapsack-solver topic page so that developers can more easily learn about it.
To associate your repository with the knapsack-solver topic, visit your repo's landing page and select "manage topics."