A POLYNOMIAL SIMPLEX-METHOD FOR THE ASSIGNMENT PROBLEM

被引：37

作者：

HUNG, MS

机构：

来源：

关键词：

D O I：

10.1287/opre.31.3.595

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：595 / 600

页数：6

共 7 条

[1] ALTERNATING BASIS ALGORITHM FOR ASSIGNMENT PROBLEMS [J].

BARR, RS ;

GLOVER, F ;

KLINGMAN, D .

[2]

CUNNINGHAM W, 1976, MATH PROGRAM, V13, P1

[3]

Cunningham W. H., 1979, Mathematics of Operations Research, V4, P196, DOI 10.1287/moor.4.2.196

[4] WORST CASE BEHAVIOR OF THE STEEPEST EDGE SIMPLEX-METHOD [J].

GOLDFARB, D ;

SIT, WY .

[5] SOLVING THE ASSIGNMENT PROBLEM BY RELAXATION [J].

HUNG, MS ;

ROM, WO .

[6]

Klee V, 1972, INEQUALITIES, VIII

[7]

Zadeh Norman, 1973, MATH PROGRAM, V5, P255, DOI [DOI 10.1007/BF01580132, 10.1007/BF01580132]