A note on finding a shortest complete cycle in an undirected graph (Q1069451)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on finding a shortest complete cycle in an undirected graph |
scientific article |
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
