Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems.
暂无分享,去创建一个
Gerald L. Thompson | V. Srinivasan | T. H. C. Smith | G. Thompson | V. Srinivasan | T. H. C. Smith | T. Smith
[1] Robert S. Garfinkel,et al. Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem , 1973, Oper. Res..
[2] V. Srinivasan,et al. SOLVING SCHEDULING PROBLEMS BY APPLYING COST OPERATORS TO ASSIGNMENT MODELS , 1973 .
[3] G. Thompson,et al. An operator theory of parametric programming for the transportation problem‐II , 1972 .
[4] Mandell Bellmore,et al. Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..
[5] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[6] Nicos Christofides,et al. Large Scheduling Problems with Bivalent Costs , 1973, Comput. J..
[7] J. Svestka,et al. Computational Experience with an M-Salesman Traveling Salesman Algorithm , 1973 .
[8] Jakob Krarup,et al. Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem , 1974, Math. Program..
[9] T. H. C. Smith,et al. A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation , 1977 .
[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. Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.
[12] Selmer M. Johnson,et al. On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem , 1959 .