2010
DOI: 10.1007/s10732-010-9127-1
|View full text |Cite
|
Sign up to set email alerts
|

On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices

Abstract: We examine the performance of different subtour-patching heuristics for solving the strongly N P-hard traveling salesman problem (TSP) on permuted Monge matrices. We prove that a well-known heuristic is asymptotically optimal for the TSP on product matrices and k-root cost matrices. We also show that the heuristic is provably asymptotically optimal for general permuted Monge matrices under some mild conditions. Our theoretical results are strongly supported by the findings of a largescale experimental study on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
references
References 19 publications
(47 reference statements)
0
0
0
Order By: Relevance