| Name | dfn-gwin-UUM |
| Download | dfn-gwin-UUM.mps.gz |
| Solution | dfn-gwin-UUM.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | C. Raack |
| Rows | 158 |
| Cols | 938 |
| Num. non-zeros in A | 2632 |
| Num. non-zeros in c | 91 |
| Rows/Cols | 0.168443496802 |
| Integers | 90 |
| Binaries | |
| Continuous | 848 |
| min nonzero |Aij| | 1 |
| max |Aij| | 622 |
| min nonzero |cj| | 716 |
| max |cj| | 8412 |
| Integer Objective | 38752 |
| LP Objective | 27467.257235 |
| Aggregation | 1 |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 111 |
| General Cons. | 45 |
| References |