A CUTTING PLANE ALGORITHM FOR MINIMUM PERFECT 2-MATCHINGS

被引：25

作者：

GROTSCHEL, M ^{[1
]}

HOLLAND, O ^{[1
]}

机构：

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

来源：

COMPUTING | 1987年 / 39卷 / 04期

关键词：

D O I：

10.1007/BF02239975

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：327 / 344

页数：18

共 10 条

[1] SOLVING LARGE-SCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS TO OPTIMALITY [J].

CROWDER, H ;

PADBERG, MW .

MANAGEMENT SCIENCE, 1980, 26 (05) :495-509

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

[3]

EDMONDS J, 1969, CODE MATCHING INTERN

[4]

GLOVER F, 1979, CCS362 CTR CYB STUD

[5] MULTI-TERMINAL NETWORK FLOWS [J].

GOMORY, RE ;

HU, TC .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1961, 9 (04) :551-570

[6] SOLVING MATCHING PROBLEMS WITH LINEAR-PROGRAMMING [J].

GROTSCHEL, M ;

HOLLAND, O .

MATHEMATICAL PROGRAMMING, 1985, 33 (03) :243-259

[7] THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION [J].

GROTSCHEL, M ;

LOVASZ, L ;

SCHRIJVER, A .

COMBINATORICA, 1981, 1 (02) :169-197

[8]

GROTSCHEL M, 1977, POLYEDRISCHE CHARAKT

[9] ODD MINIMUM CUT-SETS AND B-MATCHINGS [J].

PADBERG, MW ;

RAO, MR .

MATHEMATICS OF OPERATIONS RESEARCH, 1982, 7 (01) :67-80

[10]

Plummer M. D., 1986, MATCHING THEORY

← 1 →