| Name | transportmoment |
| Download | transportmoment.mps.gz |
| Solution | transportmoment.sol.gz |
| Set Membership | Challenge Unstable |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | G. Gamrath |
| Rows | 9616 |
| Cols | 9685 |
| Num. non-zeros in A | 29541 |
| Num. non-zeros in c | 3176 |
| Rows/Cols | 0.992875580795 |
| Integers | |
| Binaries | 2456 |
| Continuous | 7229 |
| min nonzero |Aij| | 1 |
| max |Aij| | 10000 |
| min nonzero |cj| | 0.01 |
| max |cj| | 98915 |
| Integer Objective | -3.063103721717e+09 |
| LP Objective | -70929535815.37999 |
| Aggregation | 507 |
| Variable Bound | 4912 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 4197 |
| General Cons. | |
| References |
Transport momentum maximization in a capacitated gas network, cycles are forbidden by pseudo pressures. Solved by Gurobi 4.6.1 (12 threads) in 30 seconds (January 2012).