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].
Original language | English (US) |
---|---|
Title of host publication | Studies in Systems, Decision and Control |
Publisher | Springer Science and Business Media Deutschland GmbH |
Pages | 135-145 |
Number of pages | 11 |
DOIs | |
State | Published - 2021 |
Publication series
Name | Studies in Systems, Decision and Control |
---|---|
Volume | 331 |
ISSN (Print) | 2198-4182 |
ISSN (Electronic) | 2198-4190 |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Control and Systems Engineering
- Automotive Engineering
- Social Sciences (miscellaneous)
- Economics, Econometrics and Finance (miscellaneous)
- Control and Optimization
- Decision Sciences (miscellaneous)