Solving Traveling Salesman Problems Using a Parallel Synchronized Branch and Bound Algorithm.
Claude G. DiderichMarc GenglerPublished in: HPCN Europe (1996)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- traveling salesman problem
- branch and bound
- combinatorial problems
- combinatorial optimization problems
- metaheuristic
- graph coloring
- finding an optimal solution
- hamiltonian cycle
- simulated annealing
- single machine scheduling problem
- max sat
- precedence constraints
- variable ordering
- optimization problems
- discrete optimization problems
- upper bounding
- integer variables
- quadratic assignment problem
- vehicle routing problem
- lower bound
- branch and bound method
- shared memory
- ant colony optimization
- upper bound
- np hard
- special case
- computational complexity
- lagrangian relaxation
- column generation
- optimal solution
- np complete