On the expected efficiency of branch and bound for the asymmetric TSP.
Alan M. FriezePublished in: CoRR (2023)
Keyphrases
- branch and bound
- search space
- optimal solution
- combinatorial optimization
- search algorithm
- branch and bound algorithm
- lower bound
- column generation
- upper bound
- traveling salesman problem
- beam search
- network design problem
- branch and bound procedure
- genetic algorithm
- np hard
- tree search
- tree search algorithm
- randomly generated problems
- search strategies
- reduce the search space
- max sat
- branch and bound search
- depth first search
- special case
- heuristic search
- particle swarm optimization
- linear programming
- search tree
- computational complexity
- branch and bound method
- ant colony optimization