Using a modified version of the greedy algorithm t
2016-08-23
0 0 0
no vote
Other
Earn points
The code can not only find the maximum value, but also find the second maximum value, so as to improve the accuracy of greedy algorithm to solve the task allocation problem to a certain extent. Although Hungarian algorithm can solve the task allocation problem well, for most people, the C + + implementation of Hungarian algorithm is too complex, while the improved version of practical greedy algorithm can be used in most cases However, it should be pointed out that we can improve the greedy algorithm to make it more accurate.
c++
算法
任务
版本
使用
改进
不是
贪心
问题
解决
精确
分配
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
No comment