Constrained spanning trees and the traveling salesman problem (Q1823163): 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 05:48, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constrained spanning trees and the traveling salesman problem |
scientific article |
Statements
Constrained spanning trees and the traveling salesman problem (English)
0 references
1989
0 references
Since the travelling salesman problem is very difficult to solve, it is of importance to find a good lower bound for the optimal value. A common method to bound the optimal value makes use of 1-trees. In this paper the authors strengthen this bound by imposing degree-constraints upon the 1- trees. This is achieved by choosing vertices for the constraints from a stable set containing 1. Computation of bounds is done using subgradient optimization. Computational results are presented.
0 references
lower bound
0 references
1-trees
0 references
degree-constraints
0 references
subgradient optimization
0 references