| Name | nu120-pr3 |
| Download | nu120-pr3.mps.gz |
| Solution | nu120-pr3.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Atamtürk, D. Rajan |
| Rows | 2210 |
| Cols | 8601 |
| Num. non-zeros in A | 25986 |
| Num. non-zeros in c | 8601 |
| Rows/Cols | 0.256946866643 |
| Integers | 61 |
| Binaries | 8540 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 120 |
| min nonzero |cj| | 5 |
| max |cj| | 720 |
| Integer Objective | 28130 |
| LP Objective | 21306.442308 |
| Aggregation | 210 |
| Variable Bound | 2 |
| Set partitioning | 3 |
| Set packing | |
| Set covering | |
| Cardinality | 1817 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 172 |
| References |