Nearest-neighbour heuristics in accelerated algorithms of optimisation problems
type: Item
instance of: scholarly article
title: Nearest-neighbour heuristics in accelerated algorithms of optimisation problems
zbMATH Open document ID: 0807.90098
DOI: 10.1016/0378-4371(94)90005-1
author: Simon C. Lin
author: H. C. Hsueh
published in: Physica A
publication date: 1994-09-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 606923
zbMATH Keywords: scalable linear algorithm
zbMATH Keywords: simulated annealing
zbMATH Keywords: travelling salesman
MaRDI profile type: Publication
full work available at URL: 0378-4371(94)90005-1
OpenAlex ID: W2016163389
cites work: Q4237477
cites work: Using simulated annealing to solve routing and location problems
cites work: The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
cites work: Q5187226
cites work: Q3693290
cites work: Q3785827
description: scientific article; zbMATH DE number 606923