The Traveling Salesman Problem – A Computational Study: 17 (Princeton Series in Applied Mathematics) - Image 1

£63.50

Princeton University Press The Traveling Salesman Problem – A Computational Study: 17 (Princeton Series in Applied Mathematics)

Name: The Traveling Salesman Problem - A Computational Study: 17 (Princeton Series in Applied Mathematics)
Brand: Princeton University Press
Price: 63.5 GBP
Availability: InStock

Architecture & Microprocessors

Same price for 5 weeks. Today is much like next week.

£64 for 35 days straight · last change was Dec 2025

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 581 days • 581 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 581 days • 6 price levels

Days at Price

Current Price

Price Analysis

Most common price: £59 (270 days, 46.5%)

Price range: £57 - £76

Price levels: 6 different prices over 581 days

Description

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.

Key Features

New

Mint Condition

Dispatch same day for order received before 12 noon

Guaranteed packaging

No quibbles returns

Product Specifications

Brand: Princeton University Press
Format: hardcover
ASIN: 0691129932
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 20 February 2007
Listed Since: 12 January 2007

Barcode

No barcode data available

Princeton University Press The Traveling Salesman Problem – A Computational Study: 17 (Princeton Series in Applied Mathematics)

Same price for 5 weeks. Today is much like next week.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Springer Metaheuristics for Combinatorial Optimization 1332

The Traveling Salesman Problem and Its Variations: 12 (Combinatorial Optimization, 12)

The Traveling Salesman Problem and Its Variations: 12 (Combinatorial Optimization, 12)

Bio-inspired Algorithms for the Vehicle Routing Problem: 161 (Studies in Computational Intelligence, 161)

Nature Inspired Optimisation for Delivery Problems: From Theory to the Real World (Natural Computing Series)

The Shortest Path Problem: Ninth DIMACS Implementation Challenge (DIMACS: Series in Discrete Mathematics and Theoretical Computer Science)

Extremal Optimization: Fundamentals, Algorithms, and Applications

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems

Vehicle Routing: Problems, Methods, and Applications (MOS-SIAM Series on Optimization)

Local Search in Combinatorial Optimization

GIS Fundamentals, Second Edition

Metaheuristics for Vehicle Routing Problems (Computer Engineering: Metaheuristics Set, 3)

Proceedings of the Fourteenth International Conference on Management Science and Engineering Management: Volume 2: 1191 (Advances in Intelligent Systems and Computing, 1191)

Introduction to Combinatorial Optimization: 196 (Springer Optimization and Its Applications, 196)

Arc Routing: Theory, Solutions and Applications

Arc Routing: Theory, Solutions and Applications

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

Sustainable Logistics and Transportation: Optimization Models and Algorithms: 129 (Springer Optimization and Its Applications, 129)

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization

Routing Problems in Multicast Networks: Approximation lower bounds and heuristics

Global Logistics Management: Volume 1 (Industrial Engineering)

Optimal Transport Methods in Economics