Sparsity pattern

hanoi5

Namehanoi5
Downloadhanoi5.mps.gz
Solutionhanoi5.sol.gz
Set Membership Challenge Reoptimize
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorM. Winkler
Rows16399
Cols3862
Num. non-zeros in A39718
Num. non-zeros in c3862
Rows/Cols4.24624546867
Integers
Binaries3862
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective1931
LP Objective1467
Aggregation
Variable Bound9121
Set partitioning
Set packing
Set covering6913
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack6913
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References pseudoboolean

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


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint