Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems

This publication has 13 references indexed in Scilit:

• A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation
  Published by Elsevier ,1977
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
  Mathematical Programming, 1974
• Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
  Operations Research, 1973
• Large scheduling problems with bivalent costs
  The Computer Journal, 1973
• An operator theory of parametric programming for the transportation problem‐I
  Naval Research Logistics Quarterly, 1972
• The traveling-salesman problem and minimum spanning trees: Part II
  Mathematical Programming, 1971
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
  Operations Research, 1971
• The Traveling-Salesman Problem and Minimum Spanning Trees
  Operations Research, 1970
• On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
  Operations Research, 1959
• Solution of a Large-Scale Traveling-Salesman Problem
  Journal of the Operations Research Society of America, 1954