| Name | d10200 |
| Download | d10200.mps.gz |
| Solution | d10200.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | COR@L test set |
| Rows | 947 |
| Cols | 2000 |
| Num. non-zeros in A | 57637 |
| Num. non-zeros in c | 2000 |
| Rows/Cols | 0.4735 |
| Integers | 1267 |
| Binaries | 733 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 135 |
| min nonzero |cj| | 1 |
| max |cj| | 120 |
| Integer Objective | 12430 |
| LP Objective | 12425.583005 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | 200 |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 72 |
| Knapsacks | 675 |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |