Multi-Constraint Knapsack Problem: Results obtained for Glover-Kochenberger and Chu-Beasley instances

Results obtained using Gurobi for solving the multi-constraint knapsack problem, using models described in Mathematical Optimization: Solving Problems using Python and Gurobi. CPU time limited to 3600 seconds. (Click on values for selecting data to display.)

Benchmark references and sources:

• A genetic algorithm for the multidimensional knapsack problem. Chu and Beasley. J Heuristics, 1998 vol. 4 (1) pp. 63-86.
• Critical event tabu search for multidimensional knapsack problems. Glover and Kochenberger. In Meta-heuristics: theory and applications, 1996