£110.00

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

Combinatorics & Graph Theory

Price data last checked 53 day(s) ago - refreshing...

View at Amazon

We'll watch every seller, every day. One email when your price arrives.

It has never been this cheap. We have no record of a lower price.

£110 today · cheaper than every other day in the last 3 months

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 38 days • 38 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 38 days • 1 price levels

Days at Price

Price Analysis

Most common price: £110 (38 days, 100.0%)

Price range: £110 - £110

Price levels: 1 different prices over 38 days

Description

Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950's and still remain an active area of research. This volume reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms. The infrastructure developed during the Challenge facilitated further research in the area, leading to substantial follow-up work as well as to better and more uniform experimental standards. The results of the Challenge included new cutting-edge techniques for emerging applications such as GPS navigation systems, providing experimental evidence of the most effective algorithms in several real-world settings.

Product Specifications

Format: hardcover
ASIN: 0821843834
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Combinatorics & Graph Theory
Domain: Amazon UK
Release Date: 15 September 2009
Listed Since: 27 June 2009

Barcode

No barcode data available

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

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

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

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

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

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

Local Search in Combinatorial Optimization

Extremal Optimization: Fundamentals, Algorithms, and Applications

Arc Routing: Theory, Solutions and Applications

Arc Routing: Theory, Solutions and Applications

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

Springer Metaheuristics for Combinatorial Optimization 1332

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

Network Design: Connectivity and Facilities Location (Series in Discrete Mathematics and Theoretical Computer Science)

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

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

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

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

The Vehicle Routing Problem: Latest Advances and New Challenges: 43 (Operations Research/Computer Science Interfaces Series, 43)

The Vehicle Routing Problem: Latest Advances and New Challenges: 43 (Operations Research/Computer Science Interfaces Series, 43)

Approximate Dynamic Programming for Dynamic Vehicle Routing: 61 (Operations Research/Computer Science Interfaces Series, 61)

Integration of Information and Optimization Models for Routing in City Logistics: 177 (International Series in Operations Research & Management Science, 177)

The Evolution of Travel Time Information Systems: The Role of Comprehensive Traffic Models and Improvements Towards Cooperative Driving Environments: ... Tracts on Transportation and Traffic, 19)

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

Springer Dynamic Programming: A Computational Tool - Vol 38