EFFICIENT DUAL SIMPLEX ALGORITHMS FOR THE ASSIGNMENT PROBLEM

被引：40

作者：

GOLDFARB, D

机构：

来源：

关键词：

D O I：

10.1007/BF01582245

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：187 / 203

页数：17

共 20 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] A PRIMAL METHOD FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS [J].

BALINSKI, ML ;

GOMORY, RE .

[3]

BALINSKI ML, UNPUB OPERATIONS RES

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

BARR, RS ;

GLOVER, F ;

KLINGMAN, D .

[5] A NEW ALGORITHM FOR THE ASSIGNMENT PROBLEM [J].

BERTSEKAS, DP .

[6]

CUNNINGHAM WH, 1978, MATH PROGRAM STUD, V8, P50, DOI 10.1007/BFb0121194

[7] NETWORK SIMPLEX METHOD [J].

CUNNINGHAM, WH .

[8]

Dantzig G.B., 1951, ACTIVITY ANAL PRODUC, P359

EDMONDS, J ;

KARP, RM .

[10]

Fredman M. L., 1982, 23rd Annual Symposium on Foundations of Computer Science, P165, DOI 10.1109/SFCS.1982.39