Sparsity pattern

f2000

Namef2000
Downloadf2000.mps.gz
Set Membership Challenge Reoptimize
Problem StatusOpen
Problem FeasibilityUnknown
Originator/ContributorM. Winkler
Rows10500
Cols4000
Num. non-zeros in A29500
Num. non-zeros in c4000
Rows/Cols2.625
Integers
Binaries4000
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer ObjectiveUnknown
LP Objective1331
Aggregation
Variable Bound2000
Set partitioning
Set packing
Set covering8500
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack8500
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References pseudoboolean

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


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