Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
László A. VéghPublished in: CoRR (2011)
Keyphrases
- minimum cost flow
- strongly polynomial
- bi objective
- network simplex algorithm
- shortest path algorithm
- shortest path
- minimum cost
- linear programming
- benchmark problems
- convex hull
- dynamic programming
- multiple objectives
- shortest path problem
- np hard
- search space
- optimization algorithm
- image segmentation
- multi objective optimization
- test problems
- simulated annealing
- worst case
- objective function