Simulated Annealing for the Multiple Choice Multidimensional Knapsack Problem
-
Updated
May 16, 2020 - C++
Simulated Annealing for the Multiple Choice Multidimensional Knapsack Problem
Paper A v3: exact certificates and reproducible evidence for Gamma-robust finite-menu discrete pricing via MCKP.
Paper B v2: batched Lagrangian bounds and reproducible evidence for Gamma-robust multiple-choice knapsack.
To associate your repository with the multiple-choice-knapsack topic, visit your repo's landing page and select "manage topics."