| Name | timtab1 |
| Download | timtab1.mps.gz |
| Solution | timtab1.sol.gz |
| Set Membership | Benchmark Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | C. Liebchen, R. Möhring |
| Rows | 171 |
| Cols | 397 |
| Num. non-zeros in A | 829 |
| Num. non-zeros in c | 128 |
| Rows/Cols | 0.430730478589 |
| Integers | 107 |
| Binaries | 64 |
| Continuous | 226 |
| min nonzero |Aij| | 1 |
| max |Aij| | 60 |
| min nonzero |cj| | 227 |
| max |cj| | 2002 |
| Integer Objective | 764772 |
| LP Objective | 28694 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 77 |
| General Cons. | 94 |
| References |