Login / Signup
Circulant TSP special cases: Easily-solvable cases and improved approximations.
Austin Beal
Yacine Bouabida
Samuel C. Gutekunst
Asta Rustad
Published in:
Oper. Res. Lett. (2024)
Keyphrases
</>
special case
np hard
computational complexity
least squares
search space
approximation algorithms
closed form
improved algorithm
traveling salesman problem
website
case study
reinforcement learning
scheduling problem
denoising
case base
combinatorial optimization
genetic algorithm
data sets
database