SOLVING MATCHING PROBLEMS WITH LINEAR-PROGRAMMING

被引：48

作者：

GROTSCHEL, M ^{[1
]}

HOLLAND, O ^{[1
]}

机构：

[1] UNIV BONN,INST OKONOMETRIE & OPERAT RES,D-5300 BONN,FED REP GER

来源：

关键词：

D O I：

10.1007/BF01584376

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：243 / 259

页数：17

共 19 条

[1]

[Anonymous], 1970, SOVIET MATH DOKL

BALL, MO ;

DERIGS, U .

[3]

BURKARD RE, 1980, SPRINGER LECTURE NOT, V184

CROWDER, H ;

PADBERG, MW .

[5]

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

[6]

DERIGS U, 1983, 83263OR U BONN I OK

[7]

DERIGS U, 1984, 84346OR U BONN I OK

[8] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

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

[9] 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-+

[10]

Ford LR., 1957, CAN J MATH, V9, P210, DOI [10.4153/CJM-1957-024-0, DOI 10.4153/CJM-1957-024-0]