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

£180.00

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

Name: The Traveling Salesman Problem and Its Variations: 12 (Combinatorial Optimization, 12)
Brand: Springer
Price: 180.0 GBP
Availability: InStock

Managers' Guides to Computing

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

£180 for 78 days straight · last change was Oct 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 583 days • 583 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 583 days • 5 price ranges

Days at Price

Current Price

Price Analysis

Most common range: £213-230 (255 days, 43.7%)

Price range: £160 - £248

Price levels: 5 price ranges over 583 days

Description

This volume, which contains chapters written by reputable researchers, provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, thorough computational analysis of heuristic and metaheuristic algorithms, theoretical analysis of approximation algorithms, including the emerging area of domination analysis of algorithms, discussion of TSP software and variations of TSP such as bottleneck TSP, generalized TSP, prize collecting TSP, maximizing TSP, orienteering problem, etc. This book is intended for researchers, practitioners, and academicians in mathematics, computer science, and operations research. It is appropriate as a reference work or as a main or supplemental textbook in graduate and senior undergraduate courses and projects.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 1402006640
Category: Books > Subjects > Business, Finance & Law > E-Commerce > Managers' Guides to Computing
Domain: Amazon UK
Release Date: 31 May 2002
Listed Since: 27 December 2006

Barcode

No barcode data available

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

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

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization: 12 (Wiley Series in Discrete Mathematics & Optimization)

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

Springer Metaheuristics for Combinatorial Optimization 1332

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

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

Extremal Optimization: Fundamentals, Algorithms, and Applications

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

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

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

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

Local Search in Combinatorial Optimization

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)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Hybrid Metaheuristics: Powerful Tools for Optimization (Artificial Intelligence: Foundations, Theory, and Algorithms)

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

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

Meta-Heuristics: Theory and Applications

Metaheuristic Algorithms: New Methods, Evaluation, and Performance Analysis: 1163 (Studies in Computational Intelligence, 1163)

Computational Techniques of the Simplex Method: 61 (International Series in Operations Research & Management Science, 61)

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

Parallel Problem Solving from Nature - PPSN V: 5th International Conference, Amsterdam, The Netherlands, September 27-30, 1998, Proceedings: 1498 (Lecture Notes in Computer Science, 1498)