| Name | usAbbrv-8-25_70 |
| Download | usAbbrv-8-25_70.mps.gz |
| Solution | usAbbrv-8-25_70.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | G. Klau |
| Rows | 3291 |
| Cols | 2312 |
| Num. non-zeros in A | 9628 |
| Num. non-zeros in c | 106 |
| Rows/Cols | 1.42344290657 |
| Integers | |
| Binaries | 1681 |
| Continuous | 631 |
| min nonzero |Aij| | 1 |
| max |Aij| | 36 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 120 |
| LP Objective | 95 |
| Aggregation | |
| Variable Bound | 1046 |
| Set partitioning | |
| Set packing | |
| Set covering | 563 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 563 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1681 |
| General Cons. | |
| References |