Sparsity pattern

50v-10

Name50v-10
Download50v-10.mps.gz
Solution50v-10.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorS. Bisaillon
Rows233
Cols2013
Num. non-zeros in A2745
Num. non-zeros in c1647
Rows/Cols0.115747640338
Integers183
Binaries1464
Continuous366
min nonzero |Aij|1
max |Aij|216
min nonzero |cj|1.65
max |cj|721.62
Integer Objective3311.179984123
LP Objective2879.065687
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/150
General Cons.183
References ShinanoAchterbergBertholdHeinzKoch2010TR

Network loading instance. Solved using ug[SCIP/spx] (see ShinanoAchterbergBertholdHeinzKoch2010TR ), a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility.


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