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:

Performance data
CPU time required
Number of solution failures
Solutions and bounds