Efficiency of a local algorithm for solving the traveling salesman problem
From MaRDI portal
Publication:916576
zbMath0703.90090MaRDI QIDQ916576
Publication date: 1988
Published in: Automation and Remote Control (Search for Journal in Brave)
traveling salesmanHamiltonian circuitcomparison of algorithmscomplete symmetric digraphslocal steepest descent algorithmsSarvanov-Doroshko algorithm
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A survey of very large-scale neighborhood search techniques, Lp-stability of estimation errors of kalman filter for tracking time-varying parameters, Domination analysis of some heuristics for the traveling salesman problem