Sparsity pattern

bnatt350

Namebnatt350
Downloadbnatt350.mps.gz
Solutionbnatt350.sol.gz
Set Membership Benchmark Primal Reoptimize
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorT. Akutsu
Rows4923
Cols3150
Num. non-zeros in A19061
Num. non-zeros in c1
Rows/Cols1.56285714286
Integers
Binaries3150
Continuous
min nonzero |Aij|0.125
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective0
LP Objective0
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering1423
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack1773
Knapsacks
Integer Knapsack
Mixed 0/11773
General Cons.
References AkutsuHayashidaTamura2009

Model to identify a singleton attractor in a Boolean network, applications in computational systems biology


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