Lower bounding procedure for the asymmetric quadratic traveling salesman problem.
Borzou RostamiFederico MalucelliPietro BelottiStefano GualandiPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- traveling salesman problem
- lower bounding
- branch and bound algorithm
- combinatorial optimization
- lower bound
- lower and upper bounds
- dynamic time warping
- multi step
- subtour elimination
- mathematical programming
- ant colony optimization
- optimization problems
- valid inequalities
- distance computation
- euclidean distance
- similarity search
- branch and bound
- objective function
- upper bound
- computational complexity
- neural network
- traveling salesman
- pairwise
- vehicle routing problem
- metaheuristic
- edit distance
- distance measure
- linear programming
- tabu search
- triangle inequality
- genetic algorithm
- itemsets