The Traveling-Salesman Problem and Minimum Spanning Trees
暂无分享,去创建一个
[1] H. Whitney. On the Abstract Properties of Linear Dependence , 1935 .
[2] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[3] W. Eastman. A Note on the Multi-Commodity Warehouse Problem , 1959 .
[4] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[5] Selmer M. Johnson,et al. On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .
[6] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[7] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[8] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[9] Alan G. Konheim,et al. Linear and Nonlinear Methods in Pattern Classification , 1964, IBM J. Res. Dev..
[10] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..
[11] D. Gale. Optimal assignments in an ordered set: An application of matroid theory , 1968 .
[12] Alex Karel Obruca. Spanning Tree Manipulation and the Travelling Salesman Problem , 1968, Comput. J..
[13] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..