| Name | mkc |
| Download | mkc.mps.gz |
| Solution | mkc.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | J. Kalagnanam, M. Dawande |
| Rows | 3411 |
| Cols | 5325 |
| Num. non-zeros in A | 17038 |
| Num. non-zeros in c | 2946 |
| Rows/Cols | 0.640563380282 |
| Integers | |
| Binaries | 5323 |
| Continuous | 2 |
| min nonzero |Aij| | 1 |
| max |Aij| | 38.31 |
| min nonzero |cj| | 3.744 |
| max |cj| | 40 |
| Integer Objective | -563.846 |
| LP Objective | -611.85 |
| Aggregation | |
| Variable Bound | 2977 |
| Set partitioning | |
| Set packing | 252 |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 24 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 26 |
| General Cons. | |
| References |