Improving TSP tours using dynamic programming over tree decomposition.
Marek CyganLukasz KowalikArkadiusz SocalaPublished in: CoRR (2017)
Keyphrases
- tree decomposition
- traveling salesman problem
- dynamic programming
- tree width
- decomposition method
- constraint networks
- probabilistic reasoning
- parallel processing
- graph theory
- branch and bound
- combinatorial optimization
- tree decompositions
- answer set programming
- constraint satisfaction problems
- ant colony optimization
- linear programming
- search space
- decomposition methods
- stereo matching
- optimal solution
- high level
- genetic algorithm
- databases
- social network analysis