Geometric and LP-based heuristics for the quadratic travelling salesman problem.
Rostislav StanekPeter GreistorferKlaus LadnerUlrich PferschyPublished in: CoRR (2018)
Keyphrases
- lp relaxation
- linear programming
- quadratic program
- pairwise
- computational complexity
- heuristic search
- objective function
- beam search
- linear program
- search algorithm
- search space
- geometric structure
- search methods
- algorithm for linear programming
- ant colony optimisation
- hyper heuristics
- mixed integer
- heuristic methods
- particle swarm optimization
- optimal solution