A Combinatorial $\tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem.
Ruben BeckerAndreas KarrenbauerPublished in: CoRR (2013)
Keyphrases
- min cost
- max flow
- dynamic programming
- computational complexity
- search space
- network flow
- worst case
- parallel implementation
- benchmark problems
- optimal solution
- segmentation algorithm
- np hard
- cost function
- ant colony optimization
- combinatorial optimization
- convergence rate
- linear programming
- simulated annealing
- objective function