| Name | ivu52 |
| Download | ivu52.mps.gz |
| Solution | ivu52.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | S. Weider |
| Rows | 2116 |
| Cols | 157591 |
| Num. non-zeros in A | 2179476 |
| Num. non-zeros in c | 157591 |
| Rows/Cols | 0.0134271627187 |
| Integers | |
| Binaries | 157591 |
| Continuous | |
| min nonzero |Aij| | 0.002666667 |
| max |Aij| | 9 |
| min nonzero |cj| | 1.581 |
| max |cj| | 8 |
| Integer Objective | 481.0068 |
| LP Objective | 480.250438 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | 2110 |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 1 |
| Knapsacks | 1 |
| Integer Knapsack | |
| Mixed 0/1 | 4 |
| General Cons. | |
| References |