Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem.
Anja FischerFrank FischerGerold JägerJens KeilwagenPaul MolitorIvo GrossePublished in: Comput. (2015)
Keyphrases
- traveling salesman problem
- exact algorithms
- combinatorial optimization
- benders decomposition
- combinatorial problems
- combinatorial optimization problems
- benchmark instances
- knapsack problem
- optimization problems
- ant colony optimization
- metaheuristic
- exact methods
- approximation algorithms
- valid inequalities
- exact solution
- vehicle routing problem
- objective function
- crossover operator
- branch and bound algorithm
- branch and bound
- traveling salesman
- max sat
- quadratic assignment problem
- genetic local search
- transportation networks
- heuristic methods
- global optimization
- cellular automata
- special case
- computational complexity