Abstract
Few combinatorial optimization problems have such widespread applicability as the traveling salesman problem (TSP). Practically any situation involving decisions that affect the sequence in which various actions, tasks or operations are to be executed, has a TSP aspect to it. Often such problems can be formulated as special TSP instances, but even more frequently the problem at hand turns out to be some “relative” of the TSP, or, mathematically speaking, some generalization of the TSP.
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
Balas, E. (2007). The Prize Collecting Traveling Salesman Problem and its Applications. 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_14
Download citation
DOI: https://doi.org/10.1007/0-306-48213-4_14
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)