Sparsity pattern

rmatr200-p20

Namermatr200-p20
Downloadrmatr200-p20.mps.gz
Solutionrmatr200-p20.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorD. Krushinsky
Rows29406
Cols29605
Num. non-zeros in A88415
Num. non-zeros in c29605
Rows/Cols0.993278162473
Integers
Binaries200
Continuous29405
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1185
Integer Objective837
LP Objective688.357943
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality1
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/129405
General Cons.
References GoldengorinKrushinsky2011 ShinanoAchterbergBertholdHeinzKoch2010TR

Instance coming from a formulation of the p-Median problem using square cost matrices. 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