Efficiency of a local algorithm for solving the traveling salesman problem

MaRDI QIDQ916576zbMATH OpenFDO

Authors G. M. Gutin

Publication date 1988

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

comparison of algorithmscomplete symmetric digraphsHamiltonian circuitlocal steepest descent algorithmsSarvanov-Doroshko algorithmtraveling salesman

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 177832
• Traveling salesman problem and local search
• Efficiency of Local Search
• scientific article; zbMATH DE number 4095236
• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
• On the approximability of the traveling salesman problem
• Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
• Local search: complexity and approximation
• scientific article; zbMATH DE number 1534500
• Approximation algorithms for the traveling salesman problem

Cited in

(7)

• Traveling salesman problem and local search
• Domination analysis of some heuristics for the traveling salesman problem
• Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
• Lp-stability of estimation errors of kalman filter for tracking time-varying parameters
• Efficiency-guided method for traveling-salesman-like resource allocation problems
• Efficiency of Local Search
• A survey of very large-scale neighborhood search techniques

This page was built for publication: Efficiency of a local algorithm for solving the traveling salesman problem

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