摘要
将指派问题的匈牙利解法用于货郎担问题，通过恰当地添加大正数构造效率矩阵，得到了计算货郎担问题较快的算法。文中给出的2个例子具体地说明了算法实施过程，该算法具有一定的实用性。
obtaining a better algorithm for solving the Traveling Salesman Problem by applying Hungarian method of assignment problem to it and by adding largely positive numbers in place on a matrix to construct the efficiency matrices. This algorithm gives two examples and concretely explains actual procedures implementing the algorithm and makes it practicable.
出处
《装甲兵工程学院学报》
2006年第1期94-98,共5页
Journal of Academy of Armored Force Engineering
关键词
指派问题
匈牙利解法
效率矩阵
TSP问题
assignment problem
Hungarian method
efficiency matrices
TSP problem
