A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow.
Satoru IwataS. Thomas McCormickMaiko ShigenoPublished in: SIAM J. Discret. Math. (2005)
Keyphrases
- strongly polynomial
- minimum cost flow
- minimum cost
- np hard
- network flow problem
- search space
- spanning tree
- objective function
- computational complexity
- worst case
- network flow
- optimal solution
- path planning
- optimization algorithm
- knapsack problem
- capacity constraints
- mathematical model
- special case
- network simplex algorithm