Edmonds polytopes and a hierarchy of combinatorial problems
暂无分享,去创建一个
[1] V. Chvátal. On certain polytopes associated with graphs , 1975 .
[2] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[3] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .
[4] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..
[5] W. T. Tutte. The Factorization of Linear Graphs , 1947 .
[6] L. Lovász. A Characterization of Perfect Graphs , 1972 .
[7] J. Trotter. Solution characteristics and algorithms for the vertex packing problem. , 1973 .
[8] C. Berge. Graphes et hypergraphes , 1970 .
[9] A. Tucker,et al. Linear Inequalities And Related Systems , 1956 .
[10] V. Chvatal,et al. Remarks on a Problem of Moser , 1972, Canadian Mathematical Bulletin.
[11] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[12] Egon Balas,et al. Letter to the Editor - A Note on the Branch-and-Bound Principle , 1968, Oper. Res..
[13] G. Dantzig,et al. Integral Extreme Points , 1968 .
[14] S. Vajda,et al. Integer Programming and Network Flows , 1970 .
[15] Vasek Chvátal,et al. Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..
[16] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[17] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[18] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[19] P. Erdös. Some remarks on the theory of graphs , 1947 .
[20] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[21] V. Chvátal,et al. Hypergraphs and Ramseyian theorems , 1971 .
[22] D. R. Fulkerson,et al. Anti-blocking polyhedra , 1972 .