Nearest-neighbour heuristics in accelerated algorithms of optimisation problems

DOI10.1016/0378-4371(94)90005-1zbMath0807.90098OpenAlexW2016163389MaRDI QIDQ1330318

H. C. Hsueh, Simon C. Lin

Publication date: 20 September 1994

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-4371(94)90005-1

zbMATH Keywords

simulated annealingtravelling salesmanscalable linear algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Using simulated annealing to solve routing and location problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nearest-neighbour heuristics in accelerated algorithms of optimisation problems