Odd Minimum Cut-Sets and b-Matchings
暂无分享,去创建一个
[1] S. Vajda,et al. Integer Programming and Network Flows , 1970 .
[2] J. Edmonds,et al. Facets of I-matching polyhedra , 1974 .
[3] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[4] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[5] Michel Balinski,et al. Establishing the matching polytope , 1972 .
[6] Manfred W. Padberg,et al. On the symmetric travelling salesman problem: A computational study , 1980 .
[7] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[8] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[9] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .
[10] W. Cunningham,et al. A primal algorithm for optimum matching , 1978 .