MINIMAL COST CUT EQUIVALENT NETWORKS

被引：2

作者：

PICARD, JC

RATLIFF, HD

机构：

[1] ECOLE POLYTECH MONTREAL,QUEBEC,CANADA

[2] UNIV FLORIDA,GAINESVILLE,FL 32601

来源：

MANAGEMENT SCIENCE SERIES A-THEORY | 1973年 / 19卷 / 09期

关键词：

D O I：

10.1287/mnsc.19.9.1087

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1087 / 1092

页数：6

共 13 条

[1]

BELLMORE M, 1971, MANAGE SCI B-APPL, V18, pB174

[2]

BUSACKER RG, 1961, ORO15 TECHN PAP

[3]

Ford Lester R., 1962, FLOWS NETWORKS

[4]

FRANK H, 1971, COMMUNICATION TRANSM

FULKERSON, DR .

[6] 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

[7] MULTI-TERMINAL NETWORK FLOWS [J].

GOMORY, RE ;

HU, TC .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1961, 9 (04) :551-570

[8]

Hammer PL., 1963, STUD CERC MAT, V14, P359

[9]

HAMMERIVANESCU PL, 1968, BOOLEAN METHODS OPER

[10]

Hu T.C., 1969, INTEGER PROGRAMMING