| Name | qiu |
| Download | qiu.mps.gz |
| Solution | qiu.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | Y. Chiu, J. Eckstein |
| Rows | 1192 |
| Cols | 840 |
| Num. non-zeros in A | 3432 |
| Num. non-zeros in c | 312 |
| Rows/Cols | 1.41904761905 |
| Integers | |
| Binaries | 48 |
| Continuous | 792 |
| min nonzero |Aij| | 0.26 |
| max |Aij| | 22.23 |
| min nonzero |cj| | 16.947 |
| max |cj| | 114.034 |
| Integer Objective | -132.873136947 |
| LP Objective | -931.638845 |
| Aggregation | |
| Variable Bound | 1056 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 136 |
| General Cons. | |
| References |