Sparsity pattern

usAbbrv-8-25_70

NameusAbbrv-8-25_70
DownloadusAbbrv-8-25_70.mps.gz
SolutionusAbbrv-8-25_70.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorG. Klau
Rows3291
Cols2312
Num. non-zeros in A9628
Num. non-zeros in c106
Rows/Cols1.42344290657
Integers
Binaries1681
Continuous631
min nonzero |Aij|1
max |Aij|36
min nonzero |cj|1
max |cj|1
Integer Objective120
LP Objective95
Aggregation
Variable Bound1046
Set partitioning
Set packing
Set covering563
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack563
Knapsacks
Integer Knapsack
Mixed 0/11681
General Cons.
References FischettiGloverLodi2005

Railway optimization problem. First solved by Gurobi 7.0 (32 threads) in about 29 hours.


Last Update February 28, 2017 by Gerald Gamrath
© 2017 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint