ON THE CYCLE POLYTOPE OF A BINARY MATROID

被引：63

作者：

BARAHONA, F

GROTSCHEL, M

机构：

[1] UNIV WATERLOO, DEPT COMBINATOR & OPTIMIZAT, WATERLOO N2L 3G1, ONTARIO, CANADA

[2] UNIV AUGSBURG, INST MATH, D-8900 AUGSBURG, FED REP GER

来源：

关键词：

D O I：

10.1016/0095-8956(86)90063-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：40 / 62

页数：23

共 11 条

[1] THE MAX-CUT PROBLEM ON GRAPHS NOT CONTRACTIBLE TO K5 [J].

BARAHONA, F .

[2]

BARAHONA F, 1983, WP83271OR U BONN I O

[3]

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

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

[5]

EDMONDS J, 1970, COMBINATORIAL STRUCT, P89

[6]

GASTOU G, 1982, WP82253OR U BONN I O

[7] ADJACENCY ON THE POSTMAN POLYHEDRON [J].

GILES, R .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (02) :172-175

[8]

Gomory R. E., 1969, Linear Algebra and Its Applications, V2, P451, DOI 10.1016/0024-3795(69)90017-2

[9]

Schrijver A., 1983, MATH PROGRAMMING STA, P439

[10]

Seymour P. D., 1981, European Journal of Combinatorics, V2, P257