| Name | triptim2 |
| Download | triptim2.mps.gz |
| Solution | triptim2.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | R. Borndörfer |
| Rows | 14427 |
| Cols | 27326 |
| Num. non-zeros in A | 521898 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.527958720632 |
| Integers | 6548 |
| Binaries | 20771 |
| Continuous | 7 |
| min nonzero |Aij| | 0.0001 |
| max |Aij| | 1024 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 12.0051 |
| LP Objective | 10.866359 |
| Aggregation | 14 |
| Variable Bound | 7 |
| Set partitioning | 50 |
| Set packing | 1898 |
| Set covering | 3784 |
| Cardinality | 2127 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 3789 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 6539 |
| References |