Optimizing tabu list size for the traveling salesman problem
type: Item
instance of: scholarly article
title: Optimizing tabu list size for the traveling salesman problem
zbMATH Open document ID: 0907.90226
DOI: 10.1016/S0305-0548(97)00030-0
author: Shigeru Tsubakitani
author: James R. Evans
published in: Computers \& Operations Research
publication date: 1998-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1202703
zbMATH Keywords: tabu search
zbMATH Keywords: symmetric traveling salesman
zbMATH Keywords: heuristics
MaRDI profile type: Publication
cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
cites work: Using tabu search techniques for graph coloring
cites work: Tabu Search—Part I
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q3994364
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
cites work: Nonoptimal Edges for the Symmetric Traveling Salesman Problem
cites work: The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
full work available at URL: s0305-0548(97)00030-0
OpenAlex ID: W1984641114
description: scientific article; zbMATH DE number 1202703