Login / Signup
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction.
Christian Ernst
Changxing Dong
Gerold Jäger
Dirk Richter
Paul Molitor
Published in:
AAIM (2010)
Keyphrases
</>
traveling salesman problem
valid inequalities
combinatorial optimization
search space
ant colony optimization
randomly generated
optimization problems
lower and upper bounds
genetic algorithm
multiscale
cost function
np complete
metaheuristic