| Name | triptim1 |
| Download | triptim1.mps.gz |
| Solution | triptim1.sol.gz |
| Set Membership | Benchmark Primal |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | R. Borndörfer |
| Rows | 15706 |
| Cols | 30055 |
| Num. non-zeros in A | 515436 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.522575278656 |
| Integers | 9597 |
| Binaries | 20451 |
| Continuous | 7 |
| min nonzero |Aij| | 0.0001 |
| max |Aij| | 6329 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 22.8681 |
| LP Objective | 22.868088 |
| Aggregation | 14 |
| Variable Bound | 7 |
| Set partitioning | |
| Set packing | 2049 |
| Set covering | 4038 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 4043 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 9590 |
| References |