Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
type: Item
instance of: scholarly article
title: Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
zbMATH Open document ID: 0668.90090
DOI: 10.1016/0167-6377(89)90037-0
author: Robert G. Bland
author: David F. Shallcross
published in: Operations Research Letters
publication date: 1989-01-01T00:00:00Z
review text: Determining efficient sequences of X-ray diffraction measurements on a four-circle diffractometer leads to extremely large traveling salesman problems. Simple TSP heuristics give substantial improvements in utilization at small computational expense. Furthermore, the Lin- Kernighan heuristic consistently produces near-optimal sequences.
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4095241
zbMATH Keywords: extremely large traveling salesman problems
zbMATH Keywords: heuristic
MaRDI profile type: Publication
full work available at URL: 0167-6377(89)90037-0
OpenAlex ID: W2002425996
cites work: Tight bounds for christofides' traveling salesman heuristic
cites work: Q3720323
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Q4875205
cites work: Q3693290
cites work: Q5187226
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
description: scientific article; zbMATH DE number 4095241