Abstract
Routing and Scheduling problems often require the determination of optimal sequences subject to a given set of constraints. The best known problem of this type is the classical Traveling Salesman Problem (TSP), calling for a minimum cost Hamiltonian cycle on a given graph.
This is a preview of subscription content, log in via an institution to check access.
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
Fischetti, M., Salazar-Gonzalez, JJ., Toth, P. (2007). The Generalized Traveling Salesman and Orienteering Problems. 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_13
Download citation
DOI: https://doi.org/10.1007/0-306-48213-4_13
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)