求解指派问题的一个算法  

An Algorithm for Solving the Assignment Problem

作　　者：谢凡荣[1] 

机构地区：[1]南昌大学数学系,江西南昌330047

出　　处：《运筹与管理》2004年第6期37-40,共4页Operations Research and Management Science

摘　　要：为了便于建立与指派问题有关的决策支持系统,本文给出了一个求解指派问题的数值算法,证明了算法的理论依据。该算法能求得问题的最优解,并具有易于编程实现、收敛性好等优点,大量数值实验表明该算法非常实用有效。For the convenience to build decision-making supporting system related to the assignment problem, a numerical algorithm is presented for solving the assignment problem in this paper。The theory, on which the algorithm depends, is proved strictly. The algorithm, which can find the optimal solution to the assignment problem, has the merits to be programmed easily and of good convergence, and many numerical experiments have verified its great practicalness and effectiveness.

关 键 词：运筹学 决策支持系统 数值实验 运输问题 指派问题 

分 类 号：O157.7[理学—数学]