Login / Signup
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP.
Vera Traub
Jens Vygen
Published in:
CoRR (2017)
Keyphrases
</>
traveling salesman problem
shortest path
ant colony optimization
lower bound
combinatorial optimization
travelling salesman
genetic algorithm
search space
data sets
neural network
real world
data mining
information systems
database systems
special case
np hard