| Name | dano3mip |
| Download | dano3mip.mps.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Bienstock |
| Rows | 3202 |
| Cols | 13873 |
| Num. non-zeros in A | 79655 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.230808044403 |
| Integers | |
| Binaries | 552 |
| Continuous | 13321 |
| min nonzero |Aij| | 0.5 |
| max |Aij| | 1000 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | Unknown |
| LP Objective | 576.23162 |
| Aggregation | |
| Variable Bound | 684 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 48 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 2470 |
| General Cons. | |
| References |