ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT LINKAGE

被引:6
作者
FUJISHIGE, S [1 ]
机构
[1] UNIV TOKYO,FAC ENGN,DEPT MATH ENGN & INSTR PHYS,BUNKYO KU,TOKYO 113,JAPAN
关键词
D O I
10.15807/jorsj.20.59
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:59 / 75
页数:17
相关论文
共 10 条
[1]  
BRUALDI RA, 1971, J LONDON MATHEMATICA, V2, P46
[2]  
Ford L. R., 1962, FLOWS NETWORKS
[3]  
FUJISHIGE S, TO BE PUBLISHED
[4]   ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT ASSIGNMENT [J].
IRI, M ;
TOMIZAWA, N .
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1976, 19 (01) :32-57
[5]   MATROID INTERSECTION ALGORITHMS [J].
LAWLER, EL .
MATHEMATICAL PROGRAMMING, 1975, 9 (01) :31-56
[6]   RADOS THEOREM FOR POLYMATROIDS [J].
MCDIARMID, CJH .
MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1975, 78 (SEP) :263-281
[7]  
Tomizawa N., 1971, Networks, V1, P173, DOI 10.1002/net.3230010206
[8]  
TOMIZAWA N, 1974, T IECE JAPAN A, V57, P834
[9]   On the abstract properties of linear dependence [J].
Whitney, H .
AMERICAN JOURNAL OF MATHEMATICS, 1935, 57 :509-533
[10]   INTRODUCTION TO MATROID THEORY [J].
WILSON, RJ .
AMERICAN MATHEMATICAL MONTHLY, 1973, 80 (05) :500-525