A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem.
Walton Pereira CoutinhoRoberto Quirino do NascimentoArtur Alves PessoaAnand SubramanianPublished in: INFORMS J. Comput. (2016)
Keyphrases
- branch and bound algorithm
- traveling salesman problem
- combinatorial optimization
- branch and bound
- lower bound
- combinatorial problems
- test problems
- upper bound
- optimization problems
- simulated annealing
- np hard
- transportation networks
- single machine scheduling problem
- ant colony optimization
- metaheuristic
- optimal solution
- precedence constraints
- traveling salesman
- hamiltonian cycle
- vehicle routing problem
- quadratic assignment problem
- branch and bound method
- valid inequalities
- lagrangian relaxation
- upper bounding
- max sat
- knapsack problem
- evolutionary algorithm