Sparsity pattern

roll3000

Nameroll3000
Downloadroll3000.mps.gz
Solutionroll3000.sol.gz
OrginatorL. Kroon
FormulatorL. Kroon
DonatorAndrea Lodi
Rows2295
Cols1166
Non-zeros29386
Integers492
Binaries246
Continuous
|Min|0.25
|Max|322
Integer Objective12890
LP Objective11097.1277
Root LP Basisroll3000.bas.gz
Set partitioning
Set packing405
Set covering119
Cardinality
Equality Knapsacks
Bin packing88
Invariant Knapsack
Knapsacks
Integer Knapsack1020
Upper bounds
Lower bounds
Mixed 0/1254
General Cons.409
References FischettiLodi2002 Vazacopoulos2006 BussieckFerrisMeeraus2007

rolling stock and line planning instance

Ryuhei Miyashiro reports solving this instance with CPLEX 10.0 by setting the mip emphasis to moving best bound.
Gabriel Tavares reports solving this instance with XPRESS 2006A with the following settings MIPRELSTOP=0.0, MIPABSSTOP=0.0, GOMCUTS=20, NODESELECTION=2, CUTFREQ=1, TREEGOMCUTS=6, and TREECOVERCUTS=3.


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