论文信息 - On the cycle polytope of a binary matroid

On the cycle polytope of a binary matroid

The convex hull of the incidence vectors of the cycles of a binary matroid is studied. We prove that a description of the facets of this polytope can be obtained from a description of the facets that contain any given vertex. The facet-inducing inequalities are given for matroids with no F:, R,,, or M(K,)* minor. We also characterize adjacency on this polytope. I( 1986 Academic Press. Inc.

Francisco Barahona | Martin Grötschel | M. Grötschel | F. Barahona

[1] Ali Ridha Mahjoub,et al. On the cut polytope , 1986, Math. Program..

[2] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[3] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[4] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .

[5] Alexander Schrijver,et al. Min-Max Results in Combinatorial Optimization , 1982, ISMP.

[6] Ellis L. Johnson,et al. Binary group and Chinese postman polyhedra , 1986, Math. Program..

[7] F. Barahona. The max-cut problem on graphs not contractible to K5 , 1983 .

[8] Paul D. Seymour,et al. Matroids and Multicommodity Flows , 1981, Eur. J. Comb..

[9] Rick Giles. Adjacency on the Postman Polyhedron , 1981 .