指派问题的树算法  

Tree algorithm for solving assignment problem

作　　者：薛翠平[1] 张薇[1] 

机构地区：[1]东北大学理学院数学系,辽宁沈阳110004

出　　处：《东北师大学报（自然科学版）》2010年第3期33-36,共4页Journal of Northeast Normal University(Natural Science Edition)

基　　金：国家自然科学基金资助重点项目(50534020)

摘　　要：给出了求解指派问题的树算法.该法将指派方案与树枝建立联系,每种指派方案对应一个树枝,通过画指派树讨论所有可能的指派方案,最后经过比较得到最优指派方案.该算法简单易懂,易于掌握,能够找到全部最优指派方案,并且容易编程实现.A tree algorithm for solving assignment problem is introduced in the paper.The tree algorithm develops communication between assignment project and tree branch,and each assignment project is corresponding to a branch.It discussed all the possible assignment projects by drawing assignment tree and eventually got optimal assignment project after comparison.The algorithm is easy to get known and master,and it＇s able to search out all of assignment projects and apt to program.

关 键 词：指派问题 树算法 最优指派方案 

分 类 号：O221.4[理学—运筹学与控制论]