On the symmetric travelling salesman problem I: Inequalities
暂无分享,去创建一个
[1] I. Heller. Neighbor relations on the convex of cyclic permutations. , 1956 .
[2] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[3] Frank Harary,et al. Graph Theory , 2016 .
[4] J. Stoer,et al. Convexity and Optimization in Finite Dimensions I , 1970 .
[5] G. Nemhauser,et al. Integer Programming , 2020 .
[6] Vasek Chvátal,et al. Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..
[7] M. R. Rao,et al. The travelling salesman problem and a class of polyhedra of diameter two , 1974, Math. Program..
[8] M. Grötschel,et al. Zur Oberflächenstruktur des Travelling Salesman Polytopen , 1974 .
[9] Martin Grötschel,et al. Partial linear characterizations of the asymmetric travelling salesman polytope , 1975, Math. Program..
[10] Martin Grötschel,et al. Lineare Charakterisierungen von Travelling Salesman Problemen , 1977, Math. Methods Oper. Res..
[11] Martin Grötschel,et al. Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme , 1977 .
[12] Martin Grötschel,et al. On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..
[13] M. Padberg,et al. On the symmetric travelling salesman problem II , 1979 .
[14] Manfred W. Padberg,et al. On the symmetric travelling salesman problem: A computational study , 1980 .