Login / Signup
Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
Neal E. Young
Published in:
CoRR (2013)
Keyphrases
</>
traveling salesman problem
worst case
lower bound
ant colony optimization
travelling salesman
three dimensional
multi dimensional
database
neural network
genetic algorithm
knowledge base
multiscale
optimal solution
evolutionary algorithm
multi objective