Sparsity pattern

toll-like

Nametoll-like
Downloadtoll-like.mps.gz
Solutiontoll-like.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorF. Hüffner
Rows4408
Cols2883
Num. non-zeros in A13224
Num. non-zeros in c2204
Rows/Cols1.52896288588
Integers
Binaries2883
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective610
LP Objective0
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering3253
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack4408
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References BockerHuffnerTrussWahlstorm2009 HuffnerBetzlerNiedermeier2010 HerrRehnSchuermann2012

Balanced subgraph instance coming from applications in bio-informatics: finding monotone subsystems in gene regulatory networks or finding optimal layouts of tanglegrams. Solved by Gurobi 4.6 (8 threads) in about four days after a variable transformation reducing symmetry which is described in HerrRehnSchuermann2012 .


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