Abstract
In this chapter we study the bottleneck traveling salesman problem (BTSP) introduced in Chapter 1. BTSP is a variation of the classical traveling salesman problem (TSP) that differs from the TSP only in the objective function. Let us first restate the problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Kabadi, S.N., Punnen, A.P. (2007). The Bottleneck TSP. In: Gutin, G., Punnen, A.P. (eds) The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol 12. Springer, Boston, MA. https://doi.org/10.1007/0-306-48213-4_15
Download citation
DOI: https://doi.org/10.1007/0-306-48213-4_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-44459-8
Online ISBN: 978-0-306-48213-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)