Branch and Bound Implementations for the Traveling Salesperson Problem - Part 1: A solution with nodes containing partial tours with constraints.
Richard WienerPublished in: J. Object Technol. (2003)
Keyphrases
- branch and bound
- partial solutions
- optimal solution
- branch and bound algorithm
- lower bound
- multiple knapsack
- search algorithm
- branch and bound method
- column generation
- search space
- network design problem
- upper bound
- tree search
- combinatorial optimization
- branch and bound procedure
- lagrangian heuristic
- mixed integer
- implicit enumeration
- minimum cost
- heuristic solution
- integer program
- linear programming relaxation
- tree search algorithm
- previously solved
- branch and bound search
- beam search
- np hard
- randomly generated problems
- lagrangian relaxation
- traveling salesman problem
- integer programming problems
- metaheuristic
- integer programming
- cutting plane
- shortest path
- constraint satisfaction
- cost function
- max sat
- constraint networks
- knapsack problem