论文信息 - A separation algorithm for the matchable set polytope

A separation algorithm for the matchable set polytope

A matchable set of a graph is a set of vertices joined in pairs by disjoint edges. Balas and Pulleyblank gave a linear-inequality description of the convex hull of matchable sets. We give a polynomial-time combinatorial algorithm for the separation problem for this polytope, and a min—max theorem characterizing the maximum violation by a given point of an inequality of the system.

William H. Cunningham | Jan Green-Krótki

[1] J. Edmonds,et al. Facets of I-matching polyhedra , 1974 .

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

[3] William H. Cunningham,et al. b-matching degree-sequence polyhedra , 1991, Comb..

[4] On T-joins and odd factors , 1987 .

[5] Ning Qi. On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph , 1987 .

[6] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[7] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[8] András Frank,et al. An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..

[9] Egon Balas,et al. The perfectly Matchable Subgraph Polytope of an arbitrary graph , 1989, Comb..