THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION

被引：1130

作者：

GROTSCHEL, M

LOVASZ, L

SCHRIJVER, A

机构：

[1] A JOZSEF UNIV, BOLYAI INST, H-6720 SZEGED, HUNGARY

[2] UNIV AMSTERDAM, INST ACTUARIAAT & ECON, AMSTERDAM, NETHERLANDS

来源：

关键词：

D O I：

10.1007/BF02579273

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：169 / 197

页数：29

共 41 条

[1]

CHU YJ, 1965, SCI SINICA, V14, P1396

[2]

Dijkstra E.W., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[3] OPTIMUM BRANCHINGS [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04) :233-+

[4]

Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113

[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, 1979, ANN DISCRETE MATH, V4, P39

[7]

Edmonds J., 1970, COMBINATORIAL STRUCT, P69

[8]

Edmonds J., 1975, ANN DISCRETE MATH, V1, P185

[9]

Edmonds J., 1973, COMBINATORIAL ALGORI, P91

[10]

Ford L. R., 1962, FLOWS NETWORKS