Sparsity pattern

iis-100-0-cov

Nameiis-100-0-cov
Downloadiis-100-0-cov.mps.gz
Solutioniis-100-0-cov.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorM. Pfetsch
Rows3831
Cols100
Num. non-zeros in A22986
Num. non-zeros in c100
Rows/Cols38.31
Integers
Binaries100
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective29
LP Objective16.666667
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering3831
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack3831
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