A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone.
Stefan PoikonenBruce L. GoldenEdward A. WasilPublished in: INFORMS J. Comput. (2019)
Keyphrases
- traveling salesman problem
- branch and bound
- combinatorial optimization
- branch and bound algorithm
- combinatorial optimization problems
- search algorithm
- column generation
- metaheuristic
- lower bound
- upper bound
- simulated annealing
- search space
- optimization problems
- branch and bound method
- branch and bound procedure
- transportation networks
- beam search
- hamiltonian cycle
- optimal solution
- vehicle routing problem
- tree search
- valid inequalities
- quadratic assignment problem
- search strategies
- linear programming relaxation
- ant colony optimization
- depth first search
- traveling salesman
- max sat
- tabu search