An augmenting-flow algorithm for a class of node-capacitated maximum flow problems.
Robert M. CurryJ. Cole SmithPublished in: Networks (2022)
Keyphrases
- maximum flow
- np hard
- minimum cut
- dynamic programming
- benchmark problems
- shortest path problem
- segmentation algorithm
- k means
- objective function
- combinatorial optimization
- tree structure
- minimum spanning tree
- combinatorial optimization problems
- spanning tree
- np complete
- linear programming
- simulated annealing
- optimal solution