论文信息 - A note on matchings and separability

A note on matchings and separability

Abstract It is observed that minimal totally dual integral systems for a class of independence systems are closely related to a type of separability. This observation is used to give a short proof, using Edmonds' matching polytype theorem, of a theorem of Cunningham and Marsh which gives a description of the minimal totally dual integral defining sysem for the matching polytope and also to show the relationship between that result and a theorem of F.R. Giles.

W. Cook

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

[2] J. Edmonds,et al. A Combinatorial Decomposition Theory , 1980, Canadian Journal of Mathematics.

[3] William Cook. A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron , 1983 .

[4] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[5] W. Pulleyblank. Dual integrality in b-matching problems , 1980 .

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

[7] W. Cunningham,et al. A primal algorithm for optimum matching , 1978 .

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

[9] A. J. Hoffman,et al. Local Unimodularity in the Matching Polytope , 1978 .

[10] William R. Pulleyblank. Total dual integrality and b-matchings , 1981, Oper. Res. Lett..

[11] Alexander Schrijver,et al. On total dual integrality , 1981 .

[12] Alexander Schrijver. Short proofs on the matching polyhedron , 1983, J. Comb. Theory, Ser. B.

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

[14] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..