| Name | set3-10 |
| Download | set3-10.mps.gz |
| Solution | set3-10.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | K. Akartunali, A. Miller |
| Rows | 3747 |
| Cols | 4019 |
| Num. non-zeros in A | 13747 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.932321473003 |
| Integers | |
| Binaries | 1424 |
| Continuous | 2595 |
| min nonzero |Aij| | 0.0225 |
| max |Aij| | 18688.7 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 185179.043049708 |
| LP Objective | 788.890655 |
| Aggregation | |
| Variable Bound | 1230 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 2517 |
| General Cons. | |
| References |