Book Search:  

 

 
Google full text of our books:

bookjacket

The Traveling Salesman Problem:
A Computational Study
David L. Applegate, Robert E. Bixby, Vasek Chvátal & William J. Cook

Winner of the 2007 Lanchester Prize, Informs

Hardcover | 2007 | $78.50 / £55.00 | ISBN: 9780691129938
608 pp. | 6 x 9 | 200 line illus. | Shopping Cart

eBook | ISBN: 9781400841103 |
Our eBook editions are available from these online vendors

Reviews | Table of Contents
Chapter 1 pdf-icon

Google full text of this book:
 

This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience.

The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.

Review:

"The authors have done a wonderful job of explaining how they developed new techniques in response to the challenges posed by ever larger instances of the Traveling Salesman Problem."--MAA Online

"By bringing together the best work from a wide array of researchers, advancing the field where needed, describing their findings in a book, and implementing everything in an extremely well-written computer program, the authors show how research in computational combinatorial optimization should be done."--Michael Trick, Operations Research Letters

"The book is certainly a must for every researcher in practical TSP-computation."--Ulrich Faigle, Mathematical Reviews

"It is very well written and clearly structured. Many examples are provided, which help the reader to better understand the presented results. The authors succeed in describing the TSP problem, beginning with its history, and the first approaches, and ending with the state of the art."--Stefan Nickel, Zentralblatt MATH

"[T]the text read[s] more like a best-seller than a tome of mathematics. . . . The resulting book provides not only a map for understanding TSP computation, but should be the starting point for anyone interested in launching a computational assault on any combinatorial optimization problem."--Jan Karel Lenstra, SIAM Review

"By bringing together the best work from a wide array of researchers, advancing the field where needed, describing their findings in a book, and implementing everything in an extremely well-written computer program, the authors show how research in computational combinatorial optimization should be done."--Michael Trick, ScienceDirect

"[T]he book provides a comprehensive treatment of the traveling salesman problem and I highly recommend it not only to specialists in the area but to anyone interested in combinatorial optimization."--EMS Newsletter

Endorsement:

More Endorsements

Table of Contents

Another Princeton book authored or coauthored by William J. Cook:

Series:

Subject Areas:

VISIT OUR MATH WEBSITE

Shopping Cart:

  • For ebooks:

Our eBook editions are available
from these online vendors:

  • Amazon Kindle Store
  • Apple iBooks
  • Barnes & Noble Nook Store
  • Google Play eBook Store
  • Kno eBook Store
  • Kobo eBook Store
  • Many of our ebooks are available through
    library electronic resources including these platforms:

  • Books at JSTOR
  • Ebrary
  • Ebook Library
  • EBSCO Ebooks
  • MyiLibrary
  • Dawsonera (UK)

  • Shopping Cart:

    • For hardcover/paperback orders:

      For hardcover/paperback orders in the United States, Canada, Latin America, Asia, and Australia

      Hardcover: $78.50 ISBN: 9780691129938

      For hardcover/paperback orders in Europe, Africa, the Middle East, and India

      Hardcover: £55.00 ISBN: 9780691129938

      Prices subject to change without notice

      File created: 3/27/2014

    Questions and comments to: webmaster@press.princeton.edu
    Princeton University Press

    New Book E-mails
    New In Print
    PUP Blog
    Videos/Audios
    Sample Chapters
    Subjects
    Series
    Catalogs
    Textbooks
    For Reviewers
    Class Use
    Rights
    Permissions
    Ordering
    Recent Awards
    Princeton Shorts
    Freshman Reading
    Princeton APPS
    PUP Europe
    About Us
    Contact Us
    Links
    F.A.Q.
    MATH SITE
    PUP Home


    Bookmark and Share
    Send me emails
    about new books in:
    Mathematics
    Physics
    Computer Science
    More Choices
    Email:
    Country:
    Name: