| Name | r80x800 |
| Download | r80x800.mps.gz |
| Solution | r80x800.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | F. Ortega, L. Wolsey |
| Rows | 880 |
| Cols | 1600 |
| Num. non-zeros in A | 3200 |
| Num. non-zeros in c | 1600 |
| Rows/Cols | 0.55 |
| Integers | |
| Binaries | 800 |
| Continuous | 800 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1000 |
| min nonzero |cj| | 1 |
| max |cj| | 39 |
| Integer Objective | 5332 |
| LP Objective | 3651.48 |
| Aggregation | |
| Variable Bound | 800 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 80 |
| General Cons. | |
| References |