摘要
根据 [2 ]中的结论 ,得到一个利用顶点的次数向量求解非平衡分派问题的算法 ,该算法不受退化解的影响 ,且其复杂性为 O(n· m3 ) .
The vector of degree is a m+1 -vector whose ith component is the degree of node iI * in a feasible spanning tree T.This paper uses this vector to discribe a method for finding optimal unbalanced assignment that terminates in at most m·(m-1) /2 pivot steps and takes at most O(n·m 3) work.
出处
《数学理论与应用》
2002年第1期123-125,共3页
Mathematical Theory and Applications
