On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid.
Shabbir AhmedQie HeShi LiGeorge L. NemhauserPublished in: SIAM J. Optim. (2016)
Keyphrases
- computational complexity
- minimum cost
- np complete
- network flow problem
- three dimensional
- np hard
- total cost
- expected cost
- grid computing
- minimum total cost
- computational cost
- cost sensitive
- square grid
- flow patterns
- high cost
- objective function
- high computational complexity
- minimal cost
- computationally efficient
- computational efficiency
- hexagonal grid
- special case
- information flow
- spanning tree
- data sets
- multi objective
- neural network