Sparsity pattern

rmatr200-p5

Namermatr200-p5
Downloadrmatr200-p5.mps.gz
Solutionrmatr200-p5.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorD. Krushinsky
Rows37617
Cols37816
Num. non-zeros in A113048
Num. non-zeros in c37816
Rows/Cols0.994737677174
Integers
Binaries200
Continuous37616
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|4850
Integer Objective4521
LP Objective3283.653831
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality1
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/137616
General Cons.
References GoldengorinKrushinsky2011

Instance coming from a formulation of the p-Median problem using square cost matrices


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