ON THE CYCLE POLYTOPE OF A BINARY MATROID

[1] THE MAX-CUT PROBLEM ON GRAPHS NOT CONTRACTIBLE TO K5 [J]. OPERATIONS RESEARCH LETTERS, 1983, 2 (03) : 107 - 111

[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]. 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]. 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

[1] THE MAX-CUT PROBLEM ON GRAPHS NOT CONTRACTIBLE TO K5 [J]. OPERATIONS RESEARCH LETTERS, 1983, 2 (03) : 107 - 111

[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]. 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]. 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