Publication

2007-01-15 - Princeton University Press

Language

English

Word Count

151,500 words, Guess

Page Count

606 pages

Physical Format

Hardcover

Identifiers

  • Open LibraryOL7759365M
  • ISBN-139780691129938
  • ISBN-100691129932
  • LibraryThing2821685
  • Goodreads366780

First Sentence

Given a set of cities along with the cost of travel between each pair of them, the traveling salesman problem, or TSP for short, is to find the cheapest way of visiting all the cities and returning to the starting point.

Subjects

Other Editions

  • The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)HardcoverPrinceton University Press2007-01-15

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!