A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm.
Satoru FujishigeKazuo IwanoJ. NakanoShu TezukaPublished in: Network Flows And Matching (1991)
Keyphrases
- objective function
- minimum cost
- dynamic programming
- np hard
- computational complexity
- k means
- segmentation algorithm
- mathematical model
- matching algorithm
- optimization model
- combinatorial optimization
- convergence rate
- simulated annealing
- network flow
- network flow problem
- similarity measure
- spanning tree
- linear programming
- optimization process
- minimum cost path
- network simplex algorithm
- energy function
- knapsack problem
- approximation algorithms
- optimal solution
- minimum cost flow