Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
暂无分享,去创建一个
[1] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[2] Martin Grötschel,et al. Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme , 1977 .
[3] Martin Grötschel,et al. On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets , 1980, Math. Oper. Res..
[4] Vasek Chvátal,et al. Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..
[5] M. Padberg,et al. On the symmetric travelling salesman problem II , 1979 .
[6] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[7] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .
[8] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[9] Martin Grötschel,et al. On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .
[10] Manfred W. Padberg,et al. On the symmetric travelling salesman problem: A computational study , 1980 .
[11] Richard M. Karp,et al. On linear characterizations of combinatorial optimization problems , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[12] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..
[13] W. T. Tutte. Lectures on matroids , 1965 .
[14] H. Whitney. On the Abstract Properties of Linear Dependence , 1935 .