A network flow algorithm to find an elementary I/O matching.
Takeo YamadaPublished in: Networks (1988)
Keyphrases
- network flow
- matching algorithm
- learning algorithm
- dynamic programming
- min cost
- optimal solution
- cost function
- segmentation algorithm
- np hard
- computational complexity
- linear programming
- simulated annealing
- optimization algorithm
- optimization method
- np complete
- knapsack problem
- optimization process
- minimum cost
- set cover
- objective function