Results for the close-enough traveling salesman problem with a branch-and-bound algorithm.
Wenda ZhangJason J. SauppeSheldon H. JacobsonPublished in: Comput. Optim. Appl. (2023)
Keyphrases
- branch and bound algorithm
- traveling salesman problem
- combinatorial optimization
- branch and bound
- lower bound
- test problems
- combinatorial problems
- optimization problems
- metaheuristic
- precedence constraints
- simulated annealing
- lagrangian relaxation
- optimal solution
- traveling salesman
- hamiltonian cycle
- upper bound
- single machine scheduling problem
- vehicle routing problem
- ant colony optimization
- valid inequalities
- quadratic assignment problem
- np hard
- upper bounding
- branch and bound method
- exact algorithms
- transportation networks
- max sat
- beam search
- neural network
- subtour elimination