ALGORITHMS FOR SOLVING INDEPENDENT-FLOW PROBLEMS

被引：52

作者：

FUJISHIGE, S ^{[1
]}

机构：

[1] UNIV TOKYO,FAC ENGN,DEPT MATH ENGN & INSTRUMENTAT PHYS,BUNKYO KU,TOKYO 113,JAPAN

来源：

关键词：

D O I：

10.15807/jorsj.21.189

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：189 / 204

页数：16

共 13 条

[1]

Berge C., 1973, GRAPHS HYPERGRAPHS, V7

[2]

EDMONDS J, 1970, P CALGARY INT C GORD, P67

[3]

Ford L. R., 1962, FLOWS NETWORKS

[4]

FUJISHIGE S, 1977, J OPER RES SOC JPN, V20, P1

[5] ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT LINKAGE [J].

FUJISHIGE, S .

[6] ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT ASSIGNMENT [J].

IRI, M ;

TOMIZAWA, N .

[7]

IRI M, UNPUBLISHED

[8]

IRI M, 1969, NETWORK FLOW TRANSPO

[9] MATROID INTERSECTION ALGORITHMS [J].

LAWLER, EL .

[10] RADOS THEOREM FOR POLYMATROIDS [J].

MCDIARMID, CJH .