Some Results on the Convex Hull of the Hamiltonian Cycles of Symetric Complete Graphs
暂无分享,去创建一个
[1] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[2] George B. Dantzig,et al. Decomposition Principle for Linear Programs , 1960 .
[3] C. Berge. Graphes et hypergraphes , 1970 .
[4] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[5] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[6] Vasek Chvátal,et al. Edmonds polytopes and weakly hamiltonian graphs , 1973, Math. Program..
[7] P. Camion. Problèmes de flots et tensions dans un graphe , 1974 .