检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《武汉理工大学学报》2007年第3期146-149,共4页Journal of Wuhan University of Technology
摘 要:对指派问题的解法——匈牙利法的现有解法进行改进,将最小元素法引入到匈牙利法中以减少某些不必要的步骤和繁琐的计算过程。并用实例比较改进前后2种解法的效率。最后得出这种改进是可行的,并且是有效的。In this paper the author amended the Hungarian method which brought out the answers of assignment problems, deflected the minimum element method into the Hungary Method in order to reduce some unnecessary steps and complicated computing process. Then compared the efficiency of the improved and unimproved solutions by citing examples. At last, it was found that this plan was reasonable,and it was an effective method.
分 类 号:O221.4[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3