The Traveling Salesman Problem and Its Variations - Combinatorial Optimization 12 (Paperback)
  • The Traveling Salesman Problem and Its Variations - Combinatorial Optimization 12 (Paperback)
zoom

The Traveling Salesman Problem and Its Variations - Combinatorial Optimization 12 (Paperback)

(editor), (editor)
£149.99
Paperback 830 Pages / Published: 18/05/2007
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket

A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and 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, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.

Publisher: Springer-Verlag New York Inc.
ISBN: 9780387444598
Number of pages: 830
Weight: 1282 g
Dimensions: 235 x 155 x 42 mm
Edition: New edition

You may also be interested in...

Proofs and Fundamentals
Added to basket
Introduction to Graph Theory
Added to basket
Discrete Mathematics
Added to basket
Problems in Probability
Added to basket
Combinatorial Optimization
Added to basket
Proofs from THE BOOK
Added to basket
A Combinatorial Introduction to Topology
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.