A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization.
Neil OlverLászló A. VéghPublished in: CoRR (2016)
Keyphrases
- strongly polynomial
- objective function
- linear programming
- learning algorithm
- expectation maximization
- dynamic programming
- computational complexity
- k means
- np hard
- probabilistic model
- detection algorithm
- optimal solution
- shortest path problem
- benchmark problems
- shortest path
- memory efficient
- simulated annealing
- cost function
- search space
- preprocessing
- segmentation algorithm
- optimization algorithm
- neural network
- energy function
- solution quality
- search algorithm
- maximum flow
- genetic algorithm