shah314/samultichoiceknapsack: Simulated Annealing Algorithm for the Multiple Choice Multidimensional Knapsack Problem
| Main Author: | Shalin Shah |
|---|---|
| Format: | info software eJournal |
| Terbitan: |
, 2019
|
| Online Access: |
https://zenodo.org/record/3344502 |
Daftar Isi:
- (Fixed a few errors in the C++ code) 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.