Knowing All Optimal Solutions Does Not Help for TSP Reoptimization.
Hans-Joachim BöckenhauerJuraj HromkovicAndreas SprockPublished in: Computation, Cooperation, and Life (2011)
Keyphrases
- optimal solution
- np hard
- search space
- traveling salesman problem
- objective function
- branch and bound
- lower bound
- branch and bound algorithm
- metaheuristic
- linear programming
- linear program
- knapsack problem
- global optimum
- ant colony optimization
- total cost
- solution quality
- travelling salesman
- feasible solution
- cost model
- iterative procedure
- optimization problems
- dynamic programming
- efficient solutions
- data sets
- web services
- metadata
- column generation