Tight lower bounds for the Traveling Salesman Problem with draft limits.
Ali BalmaMehdi MradTalel LadhariPublished in: Comput. Oper. Res. (2023)
Keyphrases
- traveling salesman problem
- lower bound
- upper bound
- branch and bound
- combinatorial optimization
- optimization problems
- branch and bound algorithm
- ant colony optimization
- objective function
- combinatorial problems
- optimal solution
- ant colony optimization algorithm
- np hard
- worst case
- combinatorial optimization problems
- vehicle routing problem
- lower and upper bounds
- hamiltonian cycle
- valid inequalities
- traveling salesman
- crossover operator
- cutting plane
- discrete particle swarm optimization
- discrete optimization problems
- metaheuristic
- linear programming relaxation
- evolutionary algorithm
- genetic local search
- neural network
- global optimization
- lagrangian relaxation
- max sat