Sparsity pattern

timtab1

Nametimtab1
Downloadtimtab1.mps.gz
Solutiontimtab1.sol.gz
Orginator
FormulatorC. Liebchen, R.H.Moehring
DonatorC. Liebchen, R.H.Moehring
Rows171
Cols397
Non-zeros829
Integers107
Binaries64
Continuous
|Min|1.00000000e+00
|Max|6.00000000e+01
Integer Objective7.64772000e+05
LP Objective2.86940000e+04
Root LP Basistimtab1.bas.gz
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Upper bounds
Lower bounds
Mixed 0/164
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+.


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