research-article

On the Complexity of Local Search for the Traveling Salesman Problem

Authors:

Christos H. Papadimitriou,

Kenneth SteiglitzAuthors Info & Claims

SIAM Journal on Computing, Volume 6, Issue 1

Pages 76 - 83

https://doi.org/10.1137/0206005

Published: 01 March 1977 Publication History

Abstract

It is shown that, unless $P = NP$, local search algorithms for the traveling salesman problem having polynomial time complexity per iteration will generate solutions arbitrarily far from the optimal.

References

[1]

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, The design and analysis of computer algorithms, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975x+470

Google Scholar

[2]

Manuel Blum, Vaughan Pratt, Robert E. Tarjan, Robert W. Floyd, Ronald L. Rivest, Time bounds for selection, J. Comput. System Sci., 7 (1973), 448–461

Digital Library

Google Scholar

[3]

N. Christofides, 1976, Private communication, March

Google Scholar

[4]

Richard M. Karp, R. E. Miller, J. W. Thatcher, Reducibility among combinatorial problemsComplexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), Plenum, New York, 1972, 85–103

Google Scholar

[5]

Shen Lin, Computer solutions of the traveling salesman problem, Bell System Tech. J., 44 (1965), 2245–2269

Crossref

Google Scholar

[6]

S. Lin, B. W. Kernighan, An effective heuristic algorithm for the traveling-salesman problem, Operations Res., 21 (1973), 498–516

Digital Library

Google Scholar

[7]

C. H. Papadimitriou, The complexity of the local structure of certain convex polytopes, Proc. 1976 Conf. on Information Systems and Sci., Johns Hopkins Univ., Baltimore, Md., 1976, 47–51, March 31–April 2

Google Scholar

[8]

D. J. Rosenkrantz, R. E. Stearns, P. M. Lewis, Approximate algorithms for the traveling salesperson problem, 15th Annual Symposium on Switching and Automata Theory (1974), IEEE Comput. Soc., Long Beach, Calif., 1974, 33–42, Oct. 14–16

Google Scholar

[9]

Sartaj Sahni, Teofilo Gonzalez, P-complete approximation problems, J. Assoc. Comput. Mach., 23 (1976), 555–565

Digital Library

Google Scholar

[10]

S. L. Savage, P. Weiner, M. J. Krone, Convergent local search, RR #14, Dept. of Comput. Sci., Yale Univ., New Haven, Conn., 1973

Google Scholar

[11]

Stanley Reiter, Gordon Sherman, Discrete optimizing, J. Soc. Indust. Appl. Math., 13 (1965), 864–889

Crossref

Google Scholar

[12]

K. Steiglitz, P. Weiner, Some improved algorithms for computer solution of the traveling salesman problem, Proc. 6th Ann. Allerton Conf. on Circuit and System Theory, Univ. of Ill., Urbana, Ill., 1968, 814–821, Oct.

Google Scholar

[13]

Sam Savage, Peter Weiner, A. Bagchi, Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient, J. Comput. System Sci., 12 (1976), 25–35

Digital Library

Google Scholar

Cited By

View all

Li W(2024)Optimizing with Attractor: A TutorialACM Computing Surveys10.1145/364835456:9(1-41)Online publication date: 15-Feb-2024
https://dl.acm.org/doi/10.1145/3648354
Li WOgden CGamess E(2022)A new approach to the traveling salesman problemProceedings of the 2022 ACM Southeast Conference10.1145/3476883.3524046(52-59)Online publication date: 18-Apr-2022
https://dl.acm.org/doi/10.1145/3476883.3524046

Index Terms

On the Complexity of Local Search for the Traveling Salesman Problem

Index terms have been assigned to the content through auto-classification.

Recommendations

The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing

The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+µ)-approximation to the optimal tour, for any fixed µ>0, in TSP instances ...
Labeled Traveling Salesman Problems: Complexity and approximation

We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of colors. We derive results regarding hardness of approximation and analyze ...
Traveling salesman problem under categorization

We introduce two new classes of traveling salesman problems (TSP1 and TSP2) which subsume the classical traveling salesman problem and the bottleneck traveling salesman problem. It is shown that these problems are strongly NP-complete on Halin graphs ...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 6, Issue 1

Mar 1977

199 pages

ISSN:0097-5397

DOI:10.1137/smjcat.1977.6.issue-1

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 March 1977

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li W(2024)Optimizing with Attractor: A TutorialACM Computing Surveys10.1145/364835456:9(1-41)Online publication date: 15-Feb-2024
https://dl.acm.org/doi/10.1145/3648354
Li WOgden CGamess E(2022)A new approach to the traveling salesman problemProceedings of the 2022 ACM Southeast Conference10.1145/3476883.3524046(52-59)Online publication date: 18-Apr-2022
https://dl.acm.org/doi/10.1145/3476883.3524046

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme

Labeled Traveling Salesman Problems: Complexity and approximation

Traveling salesman problem under categorization

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations