- 1.6k Downloads
When solving TSPs in practice, the main interest, of course, lies in computing good feasible tours. But, in addition, one would like to have some guarantee on the quality of the solutions found. Such guarantees can, except for weak a-priori guarantees for some heuristics, only be given if a lower bound for the length of a shortest possible tour is known.
KeywordsSpan Tree Minimum Span Tree Lagrangean Relaxation Subgradient Method Integer Linear Programming Formulation
Unable to display preview. Download preview PDF.