A deterministic annealing algorithm for the minimum concave cost network flow problem.
Chuangyin DangYabin SunYuping WangYang YangPublished in: Neural Networks (2011)
Keyphrases
- minimum cost
- annealing algorithm
- network flow problem
- deterministic annealing
- protein folding
- minimal cost
- simulated annealing algorithm
- np hard
- objective function
- network flow
- simulated annealing
- approximation algorithms
- data clustering
- global optimization
- linear programming
- special case
- network design problem
- integer programming
- free energy
- energy function
- tabu search
- lower bound