On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem.
Donald GoldfarbJianxiu HaoPublished in: Discret. Appl. Math. (1993)
Keyphrases
- detection algorithm
- learning algorithm
- experimental evaluation
- objective function
- cost function
- maximum flow
- times faster
- dynamic programming
- significant improvement
- k means
- preprocessing
- computational complexity
- improved algorithm
- np hard
- probabilistic model
- clustering method
- simplex algorithm
- neural network
- worst case
- computationally efficient
- segmentation algorithm
- convex hull
- convergence rate