seymour

benchmark binary benchmark_suitable variable_bound set_covering

Submitter Variables Constraints Density Status Group Objective MPS File
W. Cook, P. Seymour 1372 4944 4.94592e-03 easy 423 seymour.mps.gz

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

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 1372 1255
Constraints 4944 4827
Binaries 1372 1255
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.00494592 0.00551876
Nonzeroes 33549 33432
Constraint Classification Properties
Original Presolved
Total 4944 4827
Empty 0 0
Free 0 0
Singleton 117 0
Aggregations 0 0
Precedence 0 0
Variable Bound 285 285
Set Partitioning 0 0
Set Packing 0 0
Set Covering 4542 4542
Cardinality 0 0
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 0 0
Indicator 0 0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components 0.7781512
Constraint % 0.0207168 18.8191 0.0207168 94.0128
Variable % 0.2186590 17.3469 0.2915450 85.5685
Score 0.1365010

Best Known Solution(s)

No solution available for seymour .

Similar instances in collection

The following instances are most similar to seymour in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

Instance Status Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Objective Tags
ramos3 open 2187 2187 0 0 2187 32805 F. Ramos 186.0* binary set_covering
iis-glass-cov easy 214 214 0 0 5375 56133 Marc Pfetsch iis 20.99999999999999 binary benchmark_suitable set_covering
glass-sc easy 214 214 0 0 6119 63918 Marc Pfetsch maxfeassub 23 benchmark binary benchmark_suitable set_covering
v150d30-2hopcds hard 150 150 0 0 7822 103991 Austin Buchanan 2hopcds 41.0 binary variable_bound set_covering
iis-hc-cov easy 297 297 0 0 9727 142971 Marc Pfetsch iis 17 binary benchmark_suitable set_covering

Reference

No bibliographic information available

Last Update 2024 by Julian Manns
generated with R Markdown
© by Zuse Institute Berlin (ZIB)
Imprint