Sparsity pattern

rmatr100-p5

Namermatr100-p5
Downloadrmatr100-p5.mps.gz
Solutionrmatr100-p5.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorD. Krushinsky
Rows8685
Cols8784
Num. non-zeros in A26152
Num. non-zeros in c8784
Rows/Cols0.988729508197
Integers
Binaries100
Continuous8684
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1135
Integer Objective976
LP Objective762.040054
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality1
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/18684
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