Sparsity pattern

rmatr100-p10

Namermatr100-p10
Downloadrmatr100-p10.mps.gz
Solutionrmatr100-p10.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorD. Krushinsky
Rows7260
Cols7359
Num. non-zeros in A21877
Num. non-zeros in c7359
Rows/Cols0.986547085202
Integers
Binaries100
Continuous7259
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|576
Integer Objective423
LP Objective360.593308
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality1
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/17259
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