On linear characterizations of combinatorial optimization problems
暂无分享,去创建一个
[1] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[2] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[3] Vasek Chvátal,et al. Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..
[4] Manfred W. Padberg,et al. On the facial structure of set packing polyhedra , 1973, Math. Program..
[5] Leslie E. Trotter,et al. Properties of vertex packing and independence system polyhedra , 1974, Math. Program..
[6] Laurence A. Wolsey,et al. Faces for a linear inequality in 0–1 variables , 1975, Math. Program..
[7] J. Maurras. Some Results on the Convex Hull of the Hamiltonian Cycles of Symetric Complete Graphs , 1975 .
[8] Egon Balas,et al. Facets of the knapsack polytope , 1975, Math. Program..
[9] I. Borosh,et al. Bounds on positive integral solutions of linear Diophantine equations , 1976 .
[10] Christos H. Papadimitriou,et al. The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..
[11] Clyde L. Monma,et al. On the Computational Complexity of Integer Programming Problems , 1978 .
[12] Martin Grötschel,et al. On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..
[13] Martin Grötschel,et al. On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..
[14] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[15] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[16] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..