Branch and Bound Implementations for the Traveling Salesperson Problem - Part 2: Single threaded solution with many inexpensive nodes.
Richard WienerPublished in: J. Object Technol. (2003)
Keyphrases
- branch and bound
- optimal solution
- lower bound
- search algorithm
- branch and bound method
- branch and bound algorithm
- column generation
- upper bound
- search space
- partial solutions
- linear programming relaxation
- tree search
- network design problem
- heuristic solution
- branch and bound procedure
- randomly generated problems
- previously solved
- beam search
- combinatorial optimization
- implicit enumeration
- np hard
- search strategy
- integer programming
- branch and bound search
- objective function
- integer programming problems
- depth first search
- tree search algorithm
- lagrangian relaxation
- exact solution
- metaheuristic
- shortest path
- search tree
- knapsack problem
- feasible solution
- linear program
- optimization problems
- dynamic programming
- special case
- neural network
- lagrangian heuristic