30-Day No-Hassle Returns
We guarantee your satisfaction on every purchase or rental with a full refund within 30 days of your purchase date.
Fast, Same-Day Customer Service
If you need help, our friendly, helpful Customer Service team will contact you the same business day.
The Best Prices on Textbook Rentals, Guaranteed
You can shop with confidence with the best rental prices at ValoreBooks.com. If you find a lower priced rental, we will match it.

Traveling Salesman Problem A Computational Study

Author: 


ISBN-13: 

9780691129938


ISBN: 

0691129932


Pub Date: 
Publisher:  Princeton University Press
Summary: "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 sin...ce 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 [read more]

Marketplace Prices
214 New from $68.85 106 Used from $55.29
  • Used $55.29
  • New $68.85
Price + Shipping
Condition
Details
Recommended
Product Details
ISBN-13:

9780691129938


ISBN:

0691129932


Pub Date:
Publisher: Princeton University Press
Where's My Stuff?
Shipping & Returns