Quadratic TSP: A lower bounding procedure and a column generation approach.
Borzou RostamiFederico MalucelliPietro BelottiStefano GualandiPublished in: FedCSIS (2013)
Keyphrases
- column generation
- lower bounding
- branch and bound algorithm
- branch and bound
- optimal solution
- lower bound
- linear programming
- combinatorial optimization
- mathematical programming
- search space
- objective function
- linear program
- dynamic time warping
- traveling salesman problem
- np hard
- upper bound
- lower and upper bounds
- integer program
- multi step
- set partitioning
- lagrangian relaxation
- integer programming
- mixed integer programming
- vehicle routing problem with time windows
- cutting plane
- similarity search
- search algorithm
- computational complexity
- pairwise
- neural network
- metaheuristic
- euclidean distance
- edit distance
- ant colony optimization
- linear programming relaxation
- constraint programming
- knapsack problem
- mixed integer
- feasible solution
- valid inequalities
- distance computation