Skip to main content
Book Chapter

The Traveling Salesman Problem

  • Korte B
  • Vygen J
DOI: 10.1007/978-3-662-21711-5_21
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In Chapter 15 we introduced the Traveling Salesman Problem (TSP) and showed that it is NP-hard (Theorem 15.41). The TSP is perhaps the best studied NP-hard combinatorial optimization problem, and there are many techniques which have been applied. We start by...

Cite

CITATION STYLE

APA

Korte, B., & Vygen, J. (2002). The Traveling Salesman Problem (pp. 473–505). https://doi.org/10.1007/978-3-662-21711-5_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free