Sparsity pattern

aflow30a

Nameaflow30a
Downloadaflow30a.mps.gz
Solutionaflow30a.sol.gz
OrginatorTobias Achterberg
FormulatorTobias Achterberg
DonatorTobias Achterberg
Rows479
Cols842
Non-zeros2091
Integers
Binaries421
Continuous
|Min|1.00000000e+00
|Max|1.00000000e+02
Integer Objective1.15800000e+03
LP Objective9.83167425e+02
Root LP Basisaflow30a.bas.gz
Set partitioning10
Set packing
Set covering
Cardinality19
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Upper bounds
Lower bounds421
Mixed 0/129
General Cons.
References Pfender2000 AchterbergKochMartin2005

arborescence flow problem on a random graph with 30 nodes and an edge density of 0.5


Last Update : 2010/06/09 13:56:10 $ by Gerald Gamrath
© 2010 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint