Abstract
The optimal bitonic tour problem is a restricted variant of the Euclidean traveling salesman problem introduced by J. L. Bentley. This problem can be solved by a dynamic programming algorithm in polynomial time [1].
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
Reference
Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. The MIT Press and McGraw-Hill Book Company (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Mankowski, M., Moshkov, M. (2021). Optimal Bitonic Tour. In: Dynamic Programming Multi-Objective Combinatorial Optimization. Studies in Systems, Decision and Control, vol 331. Springer, Cham. https://doi.org/10.1007/978-3-030-63920-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-63920-4_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-63919-8
Online ISBN: 978-3-030-63920-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)