Abstract
The most challenging algorithmic problems involve optimization, where we seek to and a solution that maximizes or minimizes an objective function. Traveling salesman is a classic optimization problem, where we seek the tour visiting all vertices of a graph at minimum total cost. But as shown in Chapter 1, it is easy to propose TSP “algorithms” that generate reasonable-looking solutions but do not always produce the minimum cost tour.
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
Corresponding author
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Skiena, S. (2020). Dynamic Programming. In: The Algorithm Design Manual. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-54256-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-54256-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-54255-9
Online ISBN: 978-3-030-54256-6
eBook Packages: Computer ScienceComputer Science (R0)