| Name | wnq-n100-mw99-14 |
| Download | wnq-n100-mw99-14.mps.gz |
| Solution | wnq-n100-mw99-14.sol.gz |
| Set Membership | Challenge Tree |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | M. Winkler |
| Rows | 656900 |
| Cols | 10000 |
| Num. non-zeros in A | 1333400 |
| Num. non-zeros in c | 10000 |
| Rows/Cols | 65.69 |
| Integers | |
| Binaries | 10000 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 99 |
| Integer Objective | 259 |
| LP Objective | 185.263158 |
| Aggregation | |
| Variable Bound | 656700 |
| Set partitioning | |
| Set packing | |
| Set covering | 200 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 200 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |