| Name | dc1c |
| Download | dc1c.mps.gz |
| Solution | dc1c.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | Double-Click SAS |
| Rows | 1649 |
| Cols | 10039 |
| Num. non-zeros in A | 121158 |
| Num. non-zeros in c | 10039 |
| Rows/Cols | 0.164259388385 |
| Integers | |
| Binaries | 8380 |
| Continuous | 1659 |
| min nonzero |Aij| | 1 |
| max |Aij| | 10000000 |
| min nonzero |cj| | 100 |
| max |cj| | 10000000 |
| Integer Objective | 1767903.6501 |
| LP Objective | 1754946.863638 |
| Aggregation | 2 |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 1 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1647 |
| General Cons. | |
| References |