| Name | n15-3 |
| Download | n15-3.mps.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Atamtürk |
| Rows | 29494 |
| Cols | 153140 |
| Num. non-zeros in A | 611000 |
| Num. non-zeros in c | 152880 |
| Rows/Cols | 0.192595011101 |
| Integers | 780 |
| Binaries | |
| Continuous | 152360 |
| min nonzero |Aij| | 1 |
| max |Aij| | 255 |
| min nonzero |cj| | 1 |
| max |cj| | 300 |
| Integer Objective | Unknown |
| LP Objective | 23703.941176 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 28974 |
| General Cons. | 520 |
| References |