Efficiency of a local algorithm for solving the traveling salesman problem
type: Item
instance of: scholarly article
title: Efficiency of a local algorithm for solving the traveling salesman problem
zbMATH Open document ID: 0703.90090
author: G. M. Gutin
published in: Automation and Remote Control
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 4154238
zbMATH Keywords: comparison of algorithms
zbMATH Keywords: local steepest descent algorithms
zbMATH Keywords: traveling salesman
zbMATH Keywords: Sarvanov-Doroshko algorithm
zbMATH Keywords: Hamiltonian circuit
zbMATH Keywords: complete symmetric digraphs
MaRDI profile type: Publication
Recommended article: Q4038710
Recommended article: Traveling salesman problem and local search
Recommended article: Efficiency of Local Search
Recommended article: Q3821967
Recommended article: Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
Recommended article: On the approximability of the traveling salesman problem
Recommended article: Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
Recommended article: Q3059322
Recommended article: Q4517278
Recommended article: Approximation algorithms for the traveling salesman problem
description: scientific article; zbMATH DE number 4154238