A simpler and faster strongly polynomial algorithm for generalized flow maximization.
Neil OlverLászló A. VéghPublished in: STOC (2017)
Keyphrases
- strongly polynomial
- detection algorithm
- learning algorithm
- computational efficiency
- similarity measure
- linear programming
- worst case
- dynamic programming
- search space
- np hard
- cost function
- preprocessing
- scheduling problem
- simulated annealing
- multi objective
- benchmark problems
- memory efficient
- minimum cost flow
- objective function