| Name | bg512142 |
| Download | bg512142.mps.gz |
| Solution | bg512142.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Miller |
| Rows | 1307 |
| Cols | 792 |
| Num. non-zeros in A | 3953 |
| Num. non-zeros in c | 552 |
| Rows/Cols | 1.65025252525 |
| Integers | |
| Binaries | 240 |
| Continuous | 552 |
| min nonzero |Aij| | 1 |
| max |Aij| | 5621 |
| min nonzero |cj| | 1 |
| max |cj| | 10000 |
| Integer Objective | 184202.75 |
| LP Objective | 144364.073815 |
| Aggregation | 4 |
| Variable Bound | 274 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 657 |
| General Cons. | |
| References |