Sparsity pattern

tanglegram1

Nametanglegram1
Downloadtanglegram1.mps.gz
Solutiontanglegram1.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorF. Hüffner
Rows68342
Cols34759
Num. non-zeros in A205026
Num. non-zeros in c34171
Rows/Cols1.96616703588
Integers
Binaries34759
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective5182
LP Objective0
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering60499
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack68342
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References BockerHuffnerTrussWahlstorm2009 HuffnerBetzlerNiedermeier2010

Balanced subgraph instance coming from applications in bio-informatics: finding monotone subsystems in gene regulatory networks or finding optimal layouts of tanglegrams


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