Branch and Bound Implementations for the Traveling Salesperson Problem - Part 3: Multi-threaded solution with many inexpensive nodes.
Richard WienerPublished in: J. Object Technol. (2003)
Keyphrases
- branch and bound
- multi threaded
- optimal solution
- lower bound
- search algorithm
- branch and bound algorithm
- branch and bound method
- search space
- upper bound
- column generation
- network design problem
- tree search
- partial solutions
- branch and bound procedure
- combinatorial optimization
- previously solved
- search strategies
- np hard
- lagrangian relaxation
- operating system
- low cost
- mixed integer programming
- objective function
- search strategy
- constraint satisfaction
- dynamic programming
- information systems
- real time