Hearin Center for Enterprise Science

Benchmarks for "The Multiple Knapsack Problem"
This multiple knapsack problem set consists of new test problems intended to be used for testing various methods for solving MK instances.

Format of the problem data:
Each problem is specified by the following free format:

a) Title
b) Problem size ( n    m)
c) Col by col specification
    c(1) a(1,1) ... a(1,m)
    c(2) a(2,1) ... a(2,m)
    c(m,1) a(m,1) ... a(m,n)
d) RHS values
    b(1) b(2) ...b(m)

Test Problems:

Problem ID		Best Known Solution
MK_gk01 MK_gk02 MK_gk03 MK_gk04 MK_gk05 MK_gk06 MK_gk07 MK_gk08 MK_gk09 MK_gk10 MK_gk11		3766 3958 5650 5764 7557 7672 19215 18801 58085 57292 95231
Benchmarks for "Unconstrained Binary Quadratic Problems" used in the paper "*One-Pass Heuristics for Unconstrained Binary Quadratic Problems",* by F. Glover, B. Alidaee, C. Rego, and G. Kochenberger (pdf file)
f1a f1b f1c f1d f1e	f2a f2b f2c f2d f2e	g2a g2b g2c g2d g2e