Branch-and-Bound for the Precedence Constrained Generalized Traveling Salesman Problem.
Raad SalmanFredrik EkstedtPeter DamaschkePublished in: SOCS (2020)
Keyphrases
- branch and bound
- traveling salesman problem
- combinatorial optimization
- branch and bound algorithm
- combinatorial optimization problems
- column generation
- optimal solution
- metaheuristic
- search algorithm
- branch and bound method
- transportation networks
- valid inequalities
- traveling salesman
- lower bound
- optimization problems
- search space
- tree search
- beam search
- simulated annealing
- upper bound
- branch and bound procedure
- vehicle routing problem
- linear programming relaxation
- search strategies
- max sat
- depth first search
- quadratic assignment problem
- cost function
- multi objective
- satisfy the triangle inequality