Non-Fiction Books:

In Pursuit of the Traveling Salesman

Mathematics at the Limits of Computation
Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Paperback / softback
$42.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

Afterpay is available on orders $100 to $2000 Learn more

6 weekly interest-free payments of $7.00 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 25 Jun - 5 Jul using International Courier

Description

What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied solution to this day. In this book, William Cook takes rea

Author Biography:

William J. Cook is professor of combinatorics and optimization at the University of Waterloo. He is the coauthor of The Traveling Salesman Problem: A Computational Study (Princeton).
Release date NZ
November 9th, 2014
Audiences
  • General (US: Trade)
  • Tertiary Education (US: College)
Illustrations
113 color illus. 19 halftones. 19 line illus. 2 tables.
Pages
248
Dimensions
152x229x14
ISBN-13
9780691163529
Product ID
22332680

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...