A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation
暂无分享,去创建一个
[1] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .
[2] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[3] R. Prim. Shortest connection networks and some generalizations , 1957 .
[4] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[5] A. M. Geoffrion. Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .
[6] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .
[7] Jakob Krarup,et al. Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem , 1974, Math. Program..
[8] Alex Karel Obruca. Spanning Tree Manipulation and the Travelling Salesman Problem , 1968, Comput. J..
[9] Ellis L. Johnson,et al. Networks and Basic Solutions , 1966, Oper. Res..
[10] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[11] Gerald L. Thompson,et al. Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems , 1972, JACM.
[12] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[13] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[14] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[15] T. C. Raymond. Heuristic algorithm for the traveling-salesman problem , 1969 .
[16] G. L. Thompson,et al. A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .
[17] Darwin Klingman,et al. The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems , 1972 .
[18] Nicos Christofides,et al. The Shortest Hamiltonian Chain of a Graph , 1970 .
[19] R. V. Slyke,et al. Computing minimum spanning trees efficiently , 1972, ACM Annual Conference.