A note of reduced dimension optimization algorithm of assignment problem

被引：4
|
作者：
Bai, Mengzhuo [1 ]
Ren, Chunyang [2 ]
Liu, Yang [3 ]
机构：
[1] Shenyang Normal Univ, Shenyang 110035, Liaoning, Peoples R China
[2] Shenyang Fourth Hosp People, Shenyang 110031, Liaoning, Peoples R China
[3] China Construct Bank, Chaoyang Branch, Chaoyang 122000, Liaoning, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2015年 / 30卷 / 04期
关键词：
Assignment problem; Inverse point; Reduced dimension;
D O I：
10.1007/s10878-015-9851-4
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Analysing the characters of the elements of the efficiency matrix of the assignment problem, we find some properties of the optimal solution. Different from the traditional algorithm, Hungarian method, we give several principles to recognize some optimal points rapidly, thus we can reduce the dimension of the assignment problem.
引用
收藏
页码：841 / 849
页数：9
相关论文
共 50 条
12345