A note on finding a shortest complete cycle in an undirected graph (Q1069451)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on finding a shortest complete cycle in an undirected graph |
scientific article; zbMATH DE number 3934805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on finding a shortest complete cycle in an undirected graph |
scientific article; zbMATH DE number 3934805 |
Statements
A note on finding a shortest complete cycle in an undirected graph (English)
0 references
1986
0 references
How to transform a shortest complete cycle problem into a traveling salesman problem is well known. Although these problems appear ill- conditioned, a 1-tree relaxation based traveling salesman algorithm solves them rather easily (up to 150 nodes), provided non-optimal edges are eliminated. The computational results are considerably better than known results for a linear programming approach.
0 references
circuits
0 references
edge elimination
0 references
shortest complete cycle problem
0 references
traveling salesman
0 references
ill-conditioned
0 references
1-tree relaxation
0 references
computational results
0 references
0 references
0 references
0.90405244
0 references
0.90405244
0 references
0 references
0.89888364
0 references
0.89185345
0 references
0.8906227
0 references
0.88997835
0 references
0.88533837
0 references
0.88481086
0 references
