Application of the noising method to the travelling salesman problem
type: Item
instance of: scholarly article
title: Application of the noising method to the travelling salesman problem
zbMATH Open document ID: 0952.90035
DOI: 10.1016/S0377-2217(99)00457-9
author: Irène Charon
author: Olivier Hudry
published in: European Journal of Operational Research
publication date: 2000-09-14T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1507972
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: noising method
zbMATH Keywords: simulated annealing
zbMATH Keywords: metaheuristics
zbMATH Keywords: travelling salesman problem
describes a project that uses: TSPLIB
MaRDI profile type: Publication
cites work: Q4365129
cites work: Q4339078
cites work: Q5729634
cites work: The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
cites work: The noising method: A new method for combinatorial optimization
cites work: The noising methods: A generalization of some metaheuristics
cites work: Q4365133
cites work: Q4845366
cites work: Q3785827
cites work: Q3677509
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: TSPLIB—A Traveling Salesman Problem Library
full work available at URL: s0377-2217(99)00457-9
OpenAlex ID: W2169275881
description: scientific article; zbMATH DE number 1507972