Sparsity pattern

bnatt400

Namebnatt400
Downloadbnatt400.mps.gz
Solutionbnatt400.sol.gz
Set Membership Challenge Reoptimize
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorT. Akutsu
Rows5614
Cols3600
Num. non-zeros in A21698
Num. non-zeros in c1
Rows/Cols1.55944444444
Integers
Binaries3600
Continuous
min nonzero |Aij|0.125
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective1
LP Objective0
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering1614
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack2014
Knapsacks
Integer Knapsack
Mixed 0/12014
General Cons.
References AkutsuHayashidaTamura2009

Model to identify a singleton attractor in a Boolean network, applications in computational systems biology. Solved by SCIP 3.0 with SoPlex 1.7.0 in half an hour. A Intel Core2 Extreme CPU X9659 @3.00GHz was used.


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