| Name | beasleyC3 |
| Download | beasleyC3.mps.gz |
| Solution | beasleyC3.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | F. Ortega, L. Wolsey |
| Rows | 1750 |
| Cols | 2500 |
| Num. non-zeros in A | 5000 |
| Num. non-zeros in c | 1250 |
| Rows/Cols | 0.7 |
| Integers | |
| Binaries | 1250 |
| Continuous | 1250 |
| min nonzero |Aij| | 1 |
| max |Aij| | 82 |
| min nonzero |cj| | 1 |
| max |cj| | 10 |
| Integer Objective | 754 |
| LP Objective | 40.426829 |
| Aggregation | 160 |
| Variable Bound | 1250 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 340 |
| General Cons. | |
| References |