| Name | leo2 |
| Download | leo2.mps.gz |
| Solution | leo2.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | COR@L test set |
| Rows | 593 |
| Cols | 11100 |
| Num. non-zeros in A | 219959 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.0534234234234 |
| Integers | |
| Binaries | 11099 |
| Continuous | 1 |
| min nonzero |Aij| | 1 |
| max |Aij| | 168705900 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 404077441.12 |
| LP Objective | 386421293.208919 |
| Aggregation | |
| Variable Bound | 9 |
| Set partitioning | |
| Set packing | 428 |
| Set covering | 9 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 10 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 147 |
| General Cons. | |
| References |