A bound for the Symmetric Travelling Salesman Problem through matroid formulation

A bound for the Symmetric Travelling Salesman Problem through matroid formulation

0.00 Avg rating0 Votes
Article ID: iaor19981483
Country: Netherlands
Volume: 83
Issue: 2
Start Page Number: 301
End Page Number: 309
Publication Date: Jun 1995
Journal: European Journal of Operational Research
Authors: ,
Keywords: graphs
Abstract:

A new bound for the Symmetric Travelling Salesman Problem is proposed, using a matroid theoretic formulation of the problem. The resulting bound is shown to present a link between the well-studied 1-tree and 2-matching bounds. Its potential is investigated.

Reviews

Required fields are marked *. Your email address will not be published.