| Name | 30n20b8 |
| Download | 30n20b8.mps.gz |
| Solution | 30n20b8.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | E. Coughlan, M. Lübbecke, J. Schulz |
| Rows | 576 |
| Cols | 18380 |
| Num. non-zeros in A | 109706 |
| Num. non-zeros in c | 2 |
| Rows/Cols | 0.0313384113166 |
| Integers | 7344 |
| Binaries | 11036 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 224 |
| min nonzero |cj| | 51 |
| max |cj| | 100 |
| Integer Objective | 302 |
| LP Objective | 1.566408 |
| Aggregation | |
| Variable Bound | 60 |
| Set partitioning | 30 |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 486 |
| References |