| Name | ns1856153 |
| Download | ns1856153.mps.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | H. Mittelmann, Neos Server |
| Rows | 35407 |
| Cols | 11998 |
| Num. non-zeros in A | 105882 |
| Num. non-zeros in c | 14 |
| Rows/Cols | 2.9510751792 |
| Integers | |
| Binaries | 11956 |
| Continuous | 42 |
| min nonzero |Aij| | 0.5 |
| max |Aij| | 998 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | Unknown |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | 11144 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 1 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 784 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 23352 |
| General Cons. | |
| References |