A combinatorial strongly polynomial algorithm for minimizing submodular functions.

Satoru Iwata Lisa Fleischer Satoru Fujishige

Published in: J. ACM (2001)

Keyphrases

strongly polynomial
dynamic programming
cost function
learning algorithm
linear programming

search space
optimization algorithm
minimum cost flow
computational complexity
worst case

simulated annealing
multi objective
probabilistic model
energy function
combinatorial optimization

greedy algorithm
lower and upper bounds
maximum flow
neural network