On common edges in optimal solutions to traveling salesman and other optimization problems.
Marek ChrobakSvatopluk PoljakPublished in: Discret. Appl. Math. (1988)
Keyphrases
- traveling salesman
- optimization problems
- traveling salesman problem
- metaheuristic
- optimal solution
- objective function
- knapsack problem
- evolutionary algorithm
- combinatorial optimization
- cost function
- quadratic assignment problem
- lower bound
- candidate solutions
- ant colony optimization
- branch and bound
- edge detector
- np hard
- search space
- tabu search
- directed graph
- solution space
- benchmark instances
- branch and bound algorithm
- simulated annealing
- vehicle routing problem
- benchmark problems
- global optimization
- solution quality
- bayesian networks
- neural network
- particle swarm optimization
- genetic algorithm