Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics.
Anja FischerFrank FischerGerold JägerJens KeilwagenPaul MolitorIvo GrossePublished in: Discret. Appl. Math. (2014)
Keyphrases
- exact algorithms
- traveling salesman problem
- combinatorial optimization
- combinatorial problems
- combinatorial optimization problems
- optimization problems
- knapsack problem
- benchmark instances
- ant colony optimization
- objective function
- graph coloring
- branch and bound
- metaheuristic
- branch and bound algorithm
- traveling salesman
- transportation networks
- valid inequalities
- lin kernighan
- genetic local search
- heuristic methods
- crossover operator
- approximation algorithms
- vehicle routing problem
- simulated annealing
- subtour elimination
- hamiltonian cycle
- quadratic assignment problem
- max sat
- exact solution
- orders of magnitude
- computational complexity