| Name | timtab1 |
| Download | timtab1.mps.gz |
| Solution | timtab1.sol.gz |
| Orginator | |
| Formulator | C. Liebchen, R.H.Moehring |
| Donator | C. Liebchen, R.H.Moehring |
| Rows | 171 |
| Cols | 397 |
| Non-zeros | 829 |
| Integers | 107 |
| Binaries | 64 |
| Continuous | |
| |Min| | 1.00000000e+00 |
| |Max| | 6.00000000e+01 |
| Integer Objective | 7.64772000e+05 |
| LP Objective | 2.86940000e+04 |
| Root LP Basis | timtab1.bas.gz |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Upper bounds | |
| Lower bounds | |
| Mixed 0/1 | 64 |
| General Cons. | 107 |
| References | LiebchenMoehring2003 |
public transport scheduling problem.
IP optimum found with CPLEX 11.2 (default settings) on a Intel Xeon 5160 (3.00 GHz, dualcore) in 980 seconds.
Solution reported by Robert Bixby using CPLEX 9.0 "with tricks".
Solution reported by C. Liebchen and R.H. Moehring using CPLEX 8.0 with problem specific cuts in less than 6 CPU hours on an Athlon XP 1500+.