ODD MINIMUM CUT-SETS AND B-MATCHINGS

被引：268

作者：

PADBERG, MW

RAO, MR

机构：

来源：

关键词：

D O I：

10.1287/moor.7.1.67

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：67 / 80

页数：14

共 18 条

[1]

Balinski M, 1972, J COMBINATORIAL THEO, V13, P1

CROWDER, H ;

PADBERG, MW .

[3]

CUNNINGHAM WH, 1978, MATH PROGRAM STUD, V8, P50, DOI 10.1007/BFb0121194

[4] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[5] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :125-+

[6]

EDMONDS J, 1969, UNPUB BLOSSOM I CODE

[7]

Edmonds J., 1971, MATH PROGRAM, V1, P127, DOI [10.1007/BF01584082, DOI 10.1007/BF01584082]

[8]

Edmonds J, 1970, COMBINATORIAL STRUCT

[9]

EDMONDS J, 1967, LECTURE NOTES U MICH

[10]

Ford L. R., 1962, FLOWS NETWORKS