Sparsity pattern

iis-pima-cov

Nameiis-pima-cov
Downloadiis-pima-cov.mps.gz
Solutioniis-pima-cov.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorM. Pfetsch
Rows7201
Cols768
Num. non-zeros in A71941
Num. non-zeros in c768
Rows/Cols9.37630208333
Integers
Binaries768
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective33
LP Objective26.620389
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering7201
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack7201
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References AmaldiPfetschTrotter2003 Pfetsch2008

Set covering instance arising from irreducible infeasible subsystem covering problems


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