Match twice and stitch: a new TSP tour construction heuristic.
type: Item
instance of: scholarly article
title: Match twice and stitch: a new TSP tour construction heuristic.
zbMATH Open document ID: 1054.90060
author: Andrew B. Kahng
author: Sherief Reda
published in: Operations Research Letters
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2125912
Wikidata QID: Q56067391
MaRDI profile type: Publication
full work available at URL: j.orl.2004.04.001
OpenAlex ID: W2136529208
cites work: Fast Algorithms for Geometric Traveling Salesman Problems
cites work: Computing Minimum-Weight Perfect Matchings
cites work: The Traveling-Salesman Problem
cites work: A Method for Solving Traveling-Salesman Problems
cites work: Restricted 2-factor polytopes
cites work: An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: Q3720323
cites work: The traveling salesman problem and its variations
cites work: A \(\frac78\)-approximation algorithm for metric Max TSP
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Improved large-step Markov chain variants for the symmetric TSP
cites work: Q4461911
cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Matching theory
cites work: Large-step Markov chains for the TSP incorporating local search heuristics
cites work: Spacefilling curves and the planar travelling salesman problem
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
DBLP publication ID: journals/orl/KahngR04
DOI: 10.1016/J.ORL.2004.04.001
description: scientific article; zbMATH DE number 2125912