Match twice and stitch: a new TSP tour construction heuristic.

DOI10.1016/j.orl.2004.04.001zbMath1054.90060WikidataQ56067391 ScholiaQ56067391MaRDI QIDQ703270

Andrew B. Kahng, Sherief Reda

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.04.001

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• Large-step Markov chains for the TSP incorporating local search heuristics
• The traveling salesman problem and its variations
• A \(\frac78\)-approximation algorithm for metric Max TSP
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Restricted 2-factor polytopes
• Improved large-step Markov chain variants for the symmetric TSP
• Spacefilling curves and the planar travelling salesman problem
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
• Computing Minimum-Weight Perfect Matchings
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• The Traveling-Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem