A faster polynomial algorithm for the constrained maximum flow problem.
Cenk ÇaliskanPublished in: Comput. Oper. Res. (2012)
Keyphrases
- computational complexity
- preprocessing
- significant improvement
- optimization algorithm
- worst case
- times faster
- learning algorithm
- detection algorithm
- np hard
- experimental evaluation
- matching algorithm
- recognition algorithm
- improved algorithm
- high accuracy
- computational cost
- theoretical analysis
- dynamic programming
- cost function
- highly efficient
- particle swarm optimization
- minimal cost
- convex hull
- clustering method
- expectation maximization
- probabilistic model
- objective function