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

Book Description | Table of Contents
Chapter 1 [in PDF format]

ADDITIONAL ENDORSEMENTS:

"This book addresses one of the most famous and important combinatorial-optimization problems--the traveling salesman problem. It is very well written, with a vivid style that captures the reader's attention. Many examples are provided that are very useful to motivate and help the reader to better understand the results presented in the book."--Matteo Fischetti, University of Padova

"This is a fantastic book. Ever since the early days of discrete optimization, the traveling salesman problem has served as the model for computationally hard problems. The authors are main players in this area who forged a team in 1988 to push the frontiers on how good we are in solving hard and large traveling salesman problems. Now they lay out their views, experience, and findings in this book."--Bert Gerards, Centrum voor Wiskunde en Informatica

Return to Book Description

File created: 7/11/2014

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

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


Bookmark and Share