Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:16, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation |
scientific article |
Statements
Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (English)
0 references
1989
0 references
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.
0 references
extremely large traveling salesman problems
0 references
heuristic
0 references
