Sparsity pattern

maxgasflow

Namemaxgasflow
Downloadmaxgasflow.mps.gz
Solutionmaxgasflow.sol.gz
Set Membership Challenge Tree
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorG. Gamrath
Rows7160
Cols7437
Num. non-zeros in A19717
Num. non-zeros in c3176
Rows/Cols0.962753798575
Integers
Binaries2456
Continuous4981
min nonzero |Aij|1
max |Aij|10000
min nonzero |cj|1e-05
max |cj|98.915
Integer Objective-4.456581931886e+07
LP Objective-70929535.9
Aggregation507
Variable Bound4912
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/11741
General Cons.
References

Transport momentum maximization in a capacitated gas network, allowing cycles. Solved by Gurobi 4.6.1 (12 threads) in 66726 seconds (January 2012). Switched to "easy" because it was solved by Gurobi 5.0 in 2882 seconds (May 2012).


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