An Asynchronous Multithreaded Algorithm for the Maximum Network Flow Problem with Nonblocking Global Relabeling Heuristic.
Bo HongZhengyu HePublished in: IEEE Trans. Parallel Distributed Syst. (2011)
Keyphrases
- optimal solution
- dynamic programming
- network flow problem
- simulated annealing
- np hard
- computational complexity
- search space
- particle swarm optimization
- expectation maximization
- network flow
- lower bound
- mathematical model
- convergence rate
- solution quality
- special case
- probabilistic model
- mixed integer programming
- objective function