The Traveling Salesman Problem: A Computational Study
(Part of the Princeton Series in Applied Mathematics Series)
No Customer Reviews
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,...
Format:Hardcover
Language:English
ISBN:0691129932
ISBN13:9780691129938
Release Date:February 2007
Publisher:Princeton University Press
Length:608 Pages
Weight:2.20 lbs.
Dimensions:1.7" x 6.4" x 9.4"
Customer Reviews
0 rating
Copyright © 2024 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks® and the ThriftBooks® logo are registered trademarks of Thrift Books Global, LLC
