The Traveling Salesman Problem And Its Variations
Sold Out
Availability:
More Details
| Description: |
- Written by reputable researchers, this book covers various important areas of study on Traveling Salesman Problem, 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, and more.
|
|---|
| Publisher: |
- Springer-Verlag New York Inc.
|
|---|
| Genre: |
- Combinatorics & Graph Theory
|
|---|
Description
Release Date:
22 May 2007
Written by reputable researchers, this book covers various important areas of study on Traveling Salesman Problem, 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, and more.
Reviews
Write a review and win a £100 
voucher
There are currently no reviews
