A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.
Satoru IwataS. Thomas McCormickMaiko ShigenoPublished in: IPCO (1999)
Keyphrases
- strongly polynomial
- learning algorithm
- linear programming
- detection algorithm
- cost function
- probabilistic model
- dynamic programming
- simulated annealing
- objective function
- minimum cost flow
- expectation maximization
- knapsack problem
- combinatorial optimization
- linear program
- mathematical model
- energy function
- optimization algorithm
- k means
- reinforcement learning