THE MINIMUM COST FLOW PROBLEM - A UNIFYING APPROACH TO DUAL ALGORITHMS AND A NEW TREE-SEARCH ALGORITHM

被引：23

作者：

HASSIN, R

机构：

来源：

关键词：

D O I：

10.1007/BF02591772

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：228 / 239

页数：12

共 13 条

[1]

[Anonymous], 1980, NETWORK FLOW PROGRAM

[2]

BAZARRAA MS, 1977, LINEAR PROGRAMMING N

[3]

Busacker R.G., 1965, FINITE GRAPHS NETWOR

[4] AN OUT-OF-KILTER METHOD FOR MINIMAL-COST FLOW PROBLEMS [J].

FULKERSON, DR .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1961, 9 (01) :18-27

GLOVER, F ;

KARNEY, D ;

KLINGMAN, D ;

NAPIER, A .

MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (05) :793-813

[6]

Glover F., 1974, Networks, V4, P191, DOI 10.1002/net.3230040302

[7]

Hoffman A. J., 1960, P S APPL MATH, P113

[8]

Hu T.C., 1969, INTEGER PROGRAMMING

[9]

JOHNSON EL, 1978, HDB OPERATIONS RES F

[10]

Klein M, 1967, MANAGE SCI, V14, P205, DOI [10.1287/mnsc.14.3.205, DOI 10.1287/MNSC.14.3.205]