A note on Hungarian method for solving assignment problem

被引：13

作者：

Dutta, Jayanta ^{[1
]}

Pal, S. C. ^{[2
]}

机构：

[1] Siliguri Inst Technol, Dept Math, Siliguri 734009, India

[2] Univ N Bengal, Dept Comp Sci & Applicat, Siliguri 734013, India

来源：

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES | 2015年 / 36卷 / 05期

关键词：

Assignment Problem; Computational cost; Hungarian method;

D O I：

10.1080/02522667.2014.926711

中图分类号：

G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];

学科分类号：

1205 ; 120501 ;

摘要：

In this paper Hungarian method is modified to find out the optimal solution of an assignment problem which reduces the computational cost of the method.

引用

页码：451 / 459

页数：9

共 5 条

[1] Kalavathy S., 2005, OPERATIONS RES
[2] Kuhn H.W., 2010, NAV RES LOGIST Q, P29, DOI [10.1002/nav.3800020109, 10.1007/978-3-540-68279-0_2]
[3] ALGORITHMS FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS
MUNKRES, J
[J]. JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1957, 5 (01): : 32 - 38
[4] Udgata Siba K., 2010, 2010 1st International Conference on Parallel, Distributed and Grid Computing (PDGC 2010), P324, DOI 10.1109/PDGC.2010.5679975
[5] SPEEDING UP THE HUNGARIAN ALGORITHM
WRIGHT, MB
[J]. COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (01) : 95 - 96

← 1 →