Establishing the matching polytope
暂无分享,去创建一个
Abstract This paper gives an elementary, inductive proof-“graphical” in spirit-of a theorem of Edmonds' which specifies the convex hull of the matchings of an arbitrary, finite, undirected graph in terms of a finite system of linear inequalities.
[1] Michel Balinski,et al. Integer Programming: Methods, Uses, Computations , 1965 .
[2] C. T. Zahn,et al. Modification of Edmonds' maximum matching algorithm , 1965 .
[3] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[4] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.