hanoi5

binary variable_bound set_covering

Submitter Variables Constraints Density Status Group Objective MPS File
M. Winkler 3862 16399 6.2713e-04 hard 1931 hanoi5.mps.gz

Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition. Solved due to the 2012 pseudo-Boolean competition.

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 3862 3000
Constraints 16399 13563
Binaries 3862 3000
Integers 0 0
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000627130 0.000789108
Nonzeroes 39718 32108
Constraint Classification Properties
Original Presolved
Total 16399 13563
Empty 0 0
Free 0 0
Singleton 365 0
Aggregations 0 0
Precedence 0 0
Variable Bound 9121 8936
Set Partitioning 0 0
Set Packing 0 0
Set Covering 6913 4627
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 2.555094
Constraint % 0.007370 0.18587 0.007370 49.3254
Variable % 0.058292 0.24424 0.058292 47.3331
Score 0.431487

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
1 1931 1931 0 0 0 - 2018-10-13 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to hanoi5 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
f2000 open 4000 4000 0 0 10500 29500 M. Winkler 1846* binary variable_bound set_covering
stein9inf easy 9 9 0 0 14 54 MIPLIB submission pool stein Infeasible infeasible binary set_covering invariant_knapsack mixed_binary
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
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 Okt 02, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint