| Name | timtab2 |
| Download | timtab2.mps.gz |
| Solution | timtab2.sol.gz |
| Orginator | |
| Formulator | C. Liebchen, R.H.Moehring |
| Donator | C. Liebchen, R.H.Moehring |
| Rows | 294 |
| Cols | 675 |
| Non-zeros | 1482 |
| Integers | 181 |
| Binaries | 113 |
| Continuous | |
| |Min| | 1.00000000e+00 |
| |Max| | 6.00000000e+01 |
| Integer Objective | 1096557 |
| LP Objective | 8.35920000e+04 |
| Root LP Basis | timtab2.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 | 113 |
| General Cons. | 181 |
| References | LiebchenMoehring2003 BussieckFerrisMeeraus2007 |
public transport scheduling problem
Christian Liebchen and Elmar Swarat solved the problem in December 2008 with a problem specific Branch-and-Cut method within 22 hours on a standard-PC.
Solved with Condor using problem specific cuts and (at times) over 500 processing unit with a total CPU time of 2744 hours. This result was presented in September 2006 and is described in BussieckFerrisMeeraus2007 .