Sparsity pattern

seymour

Nameseymour
Downloadseymour.mps.gz
Solutionseymour.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorW. Cook, P. Seymour
Rows4944
Cols1372
Num. non-zeros in A33549
Num. non-zeros in c1372
Rows/Cols3.60349854227
Integers
Binaries1372
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective423
LP Objective403.846474
Aggregation
Variable Bound285
Set partitioning
Set packing
Set covering4542
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack4542
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References

A set-covering problem that arose from work related to the proof of the 4-color theorem.


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