Branch-and-bound for the Precedence Constrained Generalized Traveling Salesman Problem.
Raad SalmanFredrik EkstedtPeter DamaschkePublished in: Oper. Res. Lett. (2020)
Keyphrases
- branch and bound
- traveling salesman problem
- combinatorial optimization
- branch and bound algorithm
- combinatorial optimization problems
- column generation
- lower bound
- optimization problems
- search algorithm
- metaheuristic
- branch and bound procedure
- simulated annealing
- tree search
- upper bound
- branch and bound method
- hamiltonian cycle
- ant colony optimization
- search space
- traveling salesman
- beam search
- vehicle routing problem
- search strategies
- valid inequalities
- quadratic assignment problem
- linear programming relaxation
- transportation networks
- depth first search
- lagrangian heuristic
- max sat
- optimal solution
- markov decision processes
- evolutionary algorithm