SOLVING THE ASSIGNMENT PROBLEM BY RELAXATION

被引：52

作者：

HUNG, MS ^{[1
]}

ROM, WO ^{[1
]}

机构：

[1] CLEVELAND STATE UNIV,CLEVELAND,OH 44115

来源：

OPERATIONS RESEARCH | 1980年 / 28卷 / 04期

关键词：

D O I：

10.1287/opre.28.4.969

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

收藏

页码：969 / 982

页数：14

相关论文

共 14 条

[1] ASSIGNMENT POLYTOPE
BALINSKI, ML
RUSSAKOFF, A
[J]. SIAM REVIEW, 1974, 16 (04) : 516 - 525
[2] A PRIMAL METHOD FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS
BALINSKI, ML
GOMORY, RE
[J]. MANAGEMENT SCIENCE, 1964, 10 (03) : 578 - 593
[3] ALTERNATING BASIS ALGORITHM FOR ASSIGNMENT PROBLEMS
BARR, RS
GLOVER, F
KLINGMAN, D
[J]. MATHEMATICAL PROGRAMMING, 1977, 13 (01) : 1 - 13
[4] BROWN JR, 1976, EFFICIENT ASSIGNMENT
[5] CHRISTOFIDES N, 1976, GRAPH THEORY
[6] NETWORK SIMPLEX METHOD
CUNNINGHAM, WH
[J]. MATHEMATICAL PROGRAMMING, 1976, 11 (02) : 105 - 116
[7] A GRAPH-THEORETIC APPROACH TO A CLASS OF INTEGER-PROGRAMMING PROBLEMS
DESLER, JF
HAKIMI, SL
[J]. OPERATIONS RESEARCH, 1969, 17 (06) : 1017 - &
[8] Dijkstra E., 1959, NUMER MATH, V1, P269
[9] DINIC EA, 1969, SOV MATH DOKL, V10, P1324
[10] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS
EDMONDS, J
KARP, RM
[J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &