Login / Signup
Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones.
Changxing Dong
Christian Ernst
Gerold Jäger
Dirk Richter
Paul Molitor
Published in:
CTW (2009)
Keyphrases
</>
integer linear programming formulation
traveling salesman problem
search algorithm
ant colony optimization
lower and upper bounds
feature selection
similarity measure
data structure
training instances
timetabling problem