| Name | uct-subprob |
| Download | uct-subprob.mps.gz |
| Solution | uct-subprob.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | G. Lach |
| Rows | 1973 |
| Cols | 2256 |
| Num. non-zeros in A | 10147 |
| Num. non-zeros in c | 1345 |
| Rows/Cols | 0.874556737589 |
| Integers | |
| Binaries | 379 |
| Continuous | 1877 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 8 |
| Integer Objective | 314 |
| LP Objective | 242 |
| Aggregation | 131 |
| Variable Bound | 91 |
| Set partitioning | |
| Set packing | 6 |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 6 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1725 |
| General Cons. | |
| References |
Subproblem of a university course timetabling problem. Switched to "easy" because it was solved by Gurobi 5.0 in 2106 seconds (May 2012).