| Name | stockholm |
| Download | stockholm.mps.gz |
| Set Membership | Challenge |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | L. Bai, P. Rubin |
| Rows | 57346 |
| Cols | 20644 |
| Num. non-zeros in A | 171076 |
| Num. non-zeros in c | 962 |
| Rows/Cols | 2.77785312924 |
| Integers | |
| Binaries | 962 |
| Continuous | 19682 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1000 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | Unknown |
| LP Objective | 0.755613 |
| Aggregation | |
| Variable Bound | 962 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 56384 |
| General Cons. | |
| References |