A SEQUENTIAL DUAL SIMPLEX ALGORITHM FOR THE LINEAR ASSIGNMENT PROBLEM

被引:7
作者
AKGUL, M
机构
关键词
D O I
10.1016/0167-6377(88)90082-X
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:155 / 158
页数:4
相关论文
共 10 条
[1]  
AKGUL M, 1988, SERC IEOR8802 BILK U
[2]  
AKGUL M, 1987, SERC IEOR8707 BILK U
[3]   SIGNATURE METHODS FOR THE ASSIGNMENT PROBLEM [J].
BALINSKI, ML .
OPERATIONS RESEARCH, 1985, 33 (03) :527-536
[4]   A COMPETITIVE (DUAL) SIMPLEX-METHOD FOR THE ASSIGNMENT PROBLEM [J].
BALINSKI, ML .
MATHEMATICAL PROGRAMMING, 1986, 34 (02) :125-141
[5]   ALTERNATING BASIS ALGORITHM FOR ASSIGNMENT PROBLEMS [J].
BARR, RS ;
GLOVER, F ;
KLINGMAN, D .
MATHEMATICAL PROGRAMMING, 1977, 13 (01) :1-13
[6]   NETWORK SIMPLEX METHOD [J].
CUNNINGHAM, WH .
MATHEMATICAL PROGRAMMING, 1976, 11 (02) :105-116
[7]  
FREDMAN M, 1984, 25TH P FOCS, P339
[8]   FIBONACCI HEAPS AND THEIR USES IN IMPROVED NETWORK OPTIMIZATION ALGORITHMS [J].
FREDMAN, ML ;
TARJAN, RE .
JOURNAL OF THE ACM, 1987, 34 (03) :596-615
[9]  
GOLDFARB D, 1985, MATH PROGRAMMING, V37, P187
[10]  
Tarjan R. E., 1983, DATA STRUCTURES NETW, DOI [10.1137/1.9781611970265, DOI 10.1137/1.9781611970265]