| Name | maxgasflow |
| Download | maxgasflow.mps.gz |
| Solution | maxgasflow.sol.gz |
| Set Membership | Challenge Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | G. Gamrath |
| Rows | 7160 |
| Cols | 7437 |
| Num. non-zeros in A | 19717 |
| Num. non-zeros in c | 3176 |
| Rows/Cols | 0.962753798575 |
| Integers | |
| Binaries | 2456 |
| Continuous | 4981 |
| 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 |
| Aggregation | 507 |
| Variable Bound | 4912 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1741 |
| 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).