Optimal Bitonic Tour

Michal Mankowski*, Mikhail Moshkov

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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 languageEnglish (US)
Title of host publicationStudies in Systems, Decision and Control
PublisherSpringer Science and Business Media Deutschland GmbH
Pages135-145
Number of pages11
DOIs
StatePublished - 2021

Publication series

NameStudies in Systems, Decision and Control
Volume331
ISSN (Print)2198-4182
ISSN (Electronic)2198-4190

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)

Fingerprint

Dive into the research topics of 'Optimal Bitonic Tour'. Together they form a unique fingerprint.

Cite this