Branch and Bound Implementations of the Traveling Salesperson Problem - Part 4: Distributed processing solution using RMI.
Richard WienerPublished in: J. Object Technol. (2003)
Keyphrases
- branch and bound
- distributed processing
- optimal solution
- search algorithm
- branch and bound algorithm
- lower bound
- branch and bound method
- partial solutions
- column generation
- search space
- previously solved
- network design problem
- upper bound
- tree search
- parallel processing
- combinatorial optimization
- randomly generated problems
- linear programming relaxation
- beam search
- branch and bound procedure
- linear programming
- implicit enumeration
- branch and bound search
- tree search algorithm
- lagrangian relaxation
- neural network
- multi objective
- metaheuristic
- mixed integer
- linear program
- cutting plane
- search tree
- integer programming
- search strategy
- bnb adopt