f2000

no_solution binary variable_bound set_covering

Submitter Variables Constraints Density Status Group Objective MPS File
M. Winkler 4000 10500 7.02381e-04 open NA f2000.mps.gz

Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 4000 3995
Constraints 10500 10495
Binaries 4000 3995
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000702381 0.000703357
Nonzeroes 29500 29490
Constraint Classification Properties
Original Presolved
Total 10500 10495
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 0 0
Precedence 0 0
Variable Bound 2000 1995
Set Partitioning 0 0
Set Packing 0 0
Set Covering 8500 8500
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 3.300161
Constraint % 0.0095300 0.0095300 0.0095300 0.0095300
Variable % 0.0500626 0.0500626 0.0500626 0.0500626
Score 0.189995

Best Known Solution(s)

No solution available for f2000 .

Similar instances in collection

The following instances are most similar to f2000 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
stein45inf easy 45 45 0 0 332 1079 MIPLIB submission pool stein Infeasible infeasible binary variable_bound set_covering invariant_knapsack mixed_binary
stein15inf easy 15 15 0 0 37 135 MIPLIB submission pool stein Infeasible infeasible binary set_covering invariant_knapsack mixed_binary
stein9inf easy 9 9 0 0 14 54 MIPLIB submission pool stein Infeasible infeasible binary set_covering invariant_knapsack mixed_binary
hanoi5 hard 3862 3862 0 0 16399 39718 M. Winkler 1931 binary variable_bound set_covering
seymour easy 1372 1372 0 0 4944 33549 W. Cook, P. Seymour 423 benchmark binary benchmark_suitable variable_bound set_covering

Reference

@misc{pseudoboolean,
 key = {pseudoboolean},
 note = {http://www.cril.univ-artois.fr/PB10/},
 title = {{P}seudo-{B}oolean {C}ompetition 2010},
 year = {2010}
}

Last Update Mär 19, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint