Sparsity pattern

berlin_5_8_0

Nameberlin_5_8_0
Downloadberlin_5_8_0.mps.gz
Solutionberlin_5_8_0.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorG. Klau
Rows1532
Cols1083
Num. non-zeros in A4507
Num. non-zeros in c49
Rows/Cols1.41458910434
Integers
Binaries794
Continuous289
min nonzero |Aij|1
max |Aij|242
min nonzero |cj|1
max |cj|1
Integer Objective62
LP Objective52
Aggregation
Variable Bound476
Set partitioning
Set packing
Set covering309
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack309
Knapsacks
Integer Knapsack
Mixed 0/1746
General Cons.
References FischettiGloverLodi2005

Railway optimization problems. The problem was solved using CPLEX 12.3 on a 32 core Sun Galaxy 4600 machine, equipped with eight Quad-Core AMD Opteron 8384 processors at 2.7 GHz and 512 GB RAM. It took approximately 9 hours. The problem was solved using CPLEX 12.4 in about 55 minutes (May 2014).


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint