Sparsity pattern

timtab2

Nametimtab2
Downloadtimtab2.mps.gz
Solutiontimtab2.sol.gz
Orginator
FormulatorC. Liebchen, R.H.Moehring
DonatorC. Liebchen, R.H.Moehring
Rows294
Cols675
Non-zeros1482
Integers181
Binaries113
Continuous
|Min|1.00000000e+00
|Max|6.00000000e+01
Integer Objective1096557
LP Objective8.35920000e+04
Root LP Basistimtab2.bas.gz
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Upper bounds
Lower bounds
Mixed 0/1113
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 .


Last Update : 2010/06/09 13:56:11 $ by Gerald Gamrath
© 2010 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint