Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives.
László A. VéghPublished in: STOC (2012)
Keyphrases
- minimum cost flow
- strongly polynomial
- network simplex algorithm
- bi objective
- shortest path algorithm
- shortest path
- minimum cost
- linear programming
- linear program
- dynamic programming
- shortest path problem
- convex hull
- multiple objectives
- benchmark problems
- optimization algorithm
- simulated annealing
- objective function
- approximation algorithms
- genetic algorithm
- combinatorial optimization
- worst case