The Travelling Salesman Problem and Its Variations

This volume provides information on 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, and branch and bound, and branch and cut algorithms.

שנה

2002

שפה

English

הוצאה

Springer

מהדורות

1

עמודים

836

ISBN

9780306482137

מקור הנתונים: Wikidata