On some applications of the patching method

zbMATH Open1136.90455MaRDI QIDQ3428835FDOQ3428835

Authors: Balázs Imreh, Szabolcs Imreh, Csanád Imreh 

Publication date: 29 March 2007

Recommendations

• Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms
• On patching algorithms for random asymmetric travelling salesman problems
• Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey
• Iterative patching and the asymmetric traveling salesman problem
• Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem

zbMATH Keywords

traveling salesman problempatching method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cited In (5)

• Some necessary conditions and a general sufficiency condition for the validity of a Gilmore-Gomory type patching scheme for the traveling salesman problem
• Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms
• Patching and thickening problems
• Analysis of Patch Substructuring Methods
• On the existence of stationary patches

This page was built for publication: On some applications of the patching method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428835)