Solving the Many to Many assignment problem by improving the Kuhn-Munkres algorithm with backtracking.
Haibin ZhuDongning LiuSiqin ZhangYu ZhuLuyao TengShaohua TengPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- learning algorithm
- k means
- experimental evaluation
- np hard
- search space
- detection algorithm
- computational cost
- recognition algorithm
- times faster
- randomly generated
- optimization algorithm
- expectation maximization
- worst case
- high accuracy
- computationally efficient
- dynamic programming
- neural network
- ant colony optimization
- path planning
- objective function
- backtracking algorithm
- network flow problem
- quadratic programming
- improved algorithm
- gradient projection
- combinatorial optimization
- matching algorithm
- clustering method
- segmentation algorithm
- theoretical analysis
- simulated annealing
- search algorithm