ON MULTICOMMODITY FLOWS IN PLANAR GRAPHS

被引：9

作者：

HASSIN, R

机构：

来源：

NETWORKS | 1984年 / 14卷 / 02期

关键词：

D O I：

10.1002/net.3230140204

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：225 / 235

页数：11

相关论文

共 11 条

[1] MAXIMUM FLOW IN (S,T) PLANAR NETWORKS [J].

HASSIN, R .

INFORMATION PROCESSING LETTERS, 1981, 13 (03) :107-107

[2]

Hu T.C., 1969, INTEGER PROGRAMMING

[3] MULTI-COMMODITY NETWORK FLOWS [J].

HU, TC .

OPERATIONS RESEARCH, 1963, 11 (03) :344-360

[4]

JEWELL WS, 1966, ORC6623 U CAL OP RES

[5] SURVEY OF LINEAR COST MULTICOMMODITY NETWORK FLOWS [J].

KENNINGTON, JL .

OPERATIONS RESEARCH, 1978, 26 (02) :209-236

[6]

Lawler E.L., 1976, COMBINATORIAL OPTIMI

[7] MULTICOMMODITY FLOWS IN PLANAR GRAPHS [J].

OKAMURA, H ;

SEYMOUR, PD .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 31 (01) :75-81

[8] ON 3-COMMODITY FLOW PROBLEM [J].

ROTHFARB, B ;

FRISCH, IT .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (01) :46-&

[9] FEASIBILITY OF 2 COMMODITY NETWORK FLOWS [J].

ROTHSCHILD, B ;

WHINSTON, A .

OPERATIONS RESEARCH, 1966, 14 (06) :1121-+

[10]

SAKAROVITCH M, 1966, ORC6625 U CAL OP RES