Total Dual Integrality of Linear Inequality Systems
暂无分享,去创建一个
[1] Alexander Schrijver,et al. On total dual integrality , 1981 .
[2] Joachim von zur Gathen,et al. Weitere zum Erfüllungsproblem polynomial äquivalente kombinatorische Aufgaben , 1976, Komplexität von Entscheidungsproblemen 1976.
[3] Alexander Schrijver,et al. Min-max Relations for Directed Graphs , 1982 .
[4] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[5] J. Edmonds,et al. Facets of I-matching polyhedra , 1974 .
[6] András Frank,et al. Finding feasible vectors of Edmonds-Giles polyhedra , 1984, J. Comb. Theory, Ser. B.
[7] V. P. Grishuhin. Polyhedra related to a lattice , 1981, Math. Program..
[8] W. Cunningham,et al. A primal algorithm for optimum matching , 1978 .
[9] W. Pulleyblank,et al. Total Dual Integrality and Integer Polyhedra , 1979 .
[10] R. Chandrasekaran. Polynomial Algorithms for Totally Dual Integral Systems and Extensions , 1981 .
[11] A. Frank. An Algorithm for Submodular Functions on Graphs , 1982 .
[12] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[13] A. Schrijver,et al. A proof of total dual integrality of matching polyhedra , 1977 .
[14] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[15] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[16] W. Pulleyblank. Dual integrality in b-matching problems , 1980 .
[17] William R. Pulleyblank. Total dual integrality and b-matchings , 1981, Oper. Res. Lett..