| Name | janos-us-DDM |
| Download | janos-us-DDM.mps.gz |
| Solution | janos-us-DDM.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | C. Raack |
| Rows | 760 |
| Cols | 2184 |
| Num. non-zeros in A | 6384 |
| Num. non-zeros in c | 84 |
| Rows/Cols | 0.347985347985 |
| Integers | 84 |
| Binaries | |
| Continuous | 2100 |
| min nonzero |Aij| | 1 |
| max |Aij| | 64 |
| min nonzero |cj| | 117 |
| max |cj| | 879 |
| Integer Objective | 1492707 |
| LP Objective | 1488134.75 |
| Aggregation | 5 |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 671 |
| General Cons. | 84 |
| References |