| Name | hanoi5 |
| Download | hanoi5.mps.gz |
| Solution | hanoi5.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | M. Winkler |
| Rows | 16399 |
| Cols | 3862 |
| Num. non-zeros in A | 39718 |
| Num. non-zeros in c | 3862 |
| Rows/Cols | 4.24624546867 |
| Integers | |
| Binaries | 3862 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 1931 |
| LP Objective | 1467 |
| Aggregation | |
| Variable Bound | 9121 |
| Set partitioning | |
| Set packing | |
| Set covering | 6913 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 6913 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |