| Name | csched008 |
| Download | csched008.mps.gz |
| Solution | csched008.sol.gz |
| Set Membership | Reoptimize Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | T. Yunes |
| Rows | 351 |
| Cols | 1536 |
| Num. non-zeros in A | 5687 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.228515625 |
| Integers | |
| Binaries | 1284 |
| Continuous | 252 |
| min nonzero |Aij| | 1 |
| max |Aij| | 178 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 173 |
| LP Objective | 171 |
| Aggregation | 10 |
| Variable Bound | 50 |
| Set partitioning | 50 |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 240 |
| General Cons. | |
| References |