Sparsity pattern

cov1075

Namecov1075
Downloadcov1075.mps.gz
Solutioncov1075.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorF. Margot
Rows637
Cols120
Num. non-zeros in A14280
Num. non-zeros in c120
Rows/Cols5.30833333333
Integers
Binaries120
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective20
LP Objective17.142857
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering252
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack637
Knapsacks
Integer Knapsack
Mixed 0/1385
General Cons.
References Colbourn2006 Margot2003

Problem of selecting a minimum collection of 7-subsets containing all 5-subsets of a ground set of 10 elements.


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