| Name | triptim3 |
| Download | triptim3.mps.gz |
| Solution | triptim3.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | R. Borndörfer |
| Rows | 14939 |
| Cols | 28440 |
| Num. non-zeros in A | 524124 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.525281293952 |
| Integers | 6812 |
| Binaries | 21621 |
| Continuous | 7 |
| min nonzero |Aij| | 0.0001 |
| max |Aij| | 4096 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 13.5311 |
| LP Objective | 13.511741 |
| Aggregation | 14 |
| Variable Bound | 7 |
| Set partitioning | 63 |
| Set packing | 1960 |
| Set covering | 3884 |
| Cardinality | 2200 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 3889 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 6803 |
| References | BorndoerferLiebchen2008 |
Trip timetable optimization problem. First solved by ParaSCIP on a supercomputer with 864 cores in 9.5 hours (November 2015).