Login / Signup

Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space.

Edward Kh. GimadiO. Yu. Tsidulko
Published in: LION (2018)
Keyphrases
  • asymptotically optimal
  • learning algorithm
  • computational complexity
  • objective function
  • optimal solution
  • search space
  • dynamic programming
  • worst case
  • np hard