Advertisement

Lower Bounds

Chapter
  • 1.6k Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 840)

Abstract

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.

Keywords

Span Tree Minimum Span Tree Lagrangean Relaxation Subgradient Method Integer Linear Programming Formulation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Personalised recommendations