| Name | sp97ar |
| Download | sp97ar.mps.gz |
| Solution | sp97ar.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | J. Goessens, S. v. Hoessel, L. Kroon |
| Rows | 1761 |
| Cols | 14101 |
| Num. non-zeros in A | 290968 |
| Num. non-zeros in c | 14101 |
| Rows/Cols | 0.124884759946 |
| Integers | |
| Binaries | 14101 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 21 |
| min nonzero |cj| | 1098188 |
| max |cj| | 93721170 |
| Integer Objective | 660705645.76 |
| LP Objective | 652560391.247564 |
| Aggregation | |
| Variable Bound | 52 |
| Set partitioning | |
| Set packing | 1140 |
| Set covering | 129 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 129 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 418 |
| General Cons. | |
| References |