| Name | mc11 |
| Download | mc11.mps.gz |
| Solution | mc11.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | F. Ortega, L. Wolsey |
| Rows | 1920 |
| Cols | 3040 |
| Num. non-zeros in A | 6080 |
| Num. non-zeros in c | 1520 |
| Rows/Cols | 0.631578947368 |
| Integers | |
| Binaries | 1520 |
| Continuous | 1520 |
| min nonzero |Aij| | 1 |
| max |Aij| | 212 |
| min nonzero |cj| | 1 |
| max |cj| | 245 |
| Integer Objective | 11689 |
| LP Objective | 608.84434 |
| Aggregation | |
| Variable Bound | 1520 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 400 |
| General Cons. | |
| References |