Skip to content

Simulated Annealing Algorithm for the Multiple Choice Multidimensional Knapsack Problem
Compare
Choose a tag to compare
@shah314 shah314 released this 27 Jun 19:14
· 19 commits to master since this release
v1.1
2980910
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Verified
Learn about vigilant mode.

Implementation of simulated annealing algorithm for the multiple choice multidimensional knapsack problem. The multiple choice knapsack problem has n groups of items and m constraints. The objective is to choose one item from each group such that the total value (profit) is maximized while all of the m constraints are satisfied.

Assets 2
Loading