Order Total (1 Item Items):
Shipping Destination:
Robert Bixby David Applegate William (13 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (13)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (10)
- As New, Fine or Near Fine (2)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (13)
- Softcover (No further results match this refinement)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (4)
- Not Print on Demand (12)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 35 (No further results match this refinement)
- Over £ 35
Free Shipping
Seller Location
Seller Rating
-
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics, 40)
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Seller: Wonder Book, Frederick, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: Very Good. . Owner's name on inside. Princeton Series in Applied Mathematics, 40. (Mathematics, Applied mathematics, Computational study).
-
The Traveling Salesman Problem
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Condition: New. pp. 606, Maps.
-
The Traveling Salesman Problem
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Condition: New. pp. 606 Illus., Maps.
-
The Traveling Salesman Problem
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Condition: New. pp. 606.
-
Traveling Salesman Problem : A Computational Study
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Condition: New.
-
The Traveling Salesman Problem
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, US, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Hardback. Condition: New. 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.
-
Traveling Salesman Problem : A Computational Study
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Condition: As New. Unread book in perfect condition.
-
Traveling Salesman Problem : A Computational Study
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Traveling Salesman Problem : A Computational Study
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics, 40)
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
The Traveling Salesman Problem
Book 15 of 33: Princeton Series in Applied MathematicsLanguage: English
Published by Princeton University Press, US, 2007
ISBN 10: 0691129932 ISBN 13: 9780691129938
Hardback. Condition: New. 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.
-
Hardcover. Condition: Brand New. 593 pages. 9.25x6.50x1.75 inches. In Stock.
-
Hardcover. Condition: Brand New. 593 pages. 9.25x6.50x1.75 inches. In Stock. This item is printed on demand.
