SIGNATURE METHODS FOR THE ASSIGNMENT PROBLEM

被引:77
作者
BALINSKI, ML
机构
关键词
D O I
10.1287/opre.33.3.527
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:527 / 536
页数:10
相关论文
共 14 条
[1]  
BALINSKI ML, 1984, MATH PROGRAM STUD, V22, P1, DOI 10.1007/BFb0121004
[2]   A PRIMAL METHOD FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS [J].
BALINSKI, ML ;
GOMORY, RE .
MANAGEMENT SCIENCE, 1964, 10 (03) :578-593
[3]   THE HIRSCH CONJECTURE FOR DUAL TRANSPORTATION POLYHEDRA [J].
BALINSKI, ML .
MATHEMATICS OF OPERATIONS RESEARCH, 1984, 9 (04) :629-633
[4]  
BALINSKI ML, 1983, CR HEBD ACAD SCI, V296, P456
[5]   ALTERNATING BASIS ALGORITHM FOR ASSIGNMENT PROBLEMS [J].
BARR, RS ;
GLOVER, F ;
KLINGMAN, D .
MATHEMATICAL PROGRAMMING, 1977, 13 (01) :1-13
[6]  
Cunningham W. H., 1979, Mathematics of Operations Research, V4, P196, DOI 10.1287/moor.4.2.196
[7]   NETWORK SIMPLEX METHOD [J].
CUNNINGHAM, WH .
MATHEMATICAL PROGRAMMING, 1976, 11 (02) :105-116
[8]  
CUNNINGHAM WH, 1983, COMMUNICATION 0919
[9]   THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].
EDMONDS, J ;
KARP, RM .
JOURNAL OF THE ACM, 1972, 19 (02) :248-&
[10]  
GOLDFARB D, 1983, EFFICIENT DUAL SIMPL