Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network.
Stefan TschökeReinhard LülingBurkhard MonienPublished in: IPPS (1995)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- traveling salesman problem
- transportation networks
- branch and bound
- combinatorial problems
- simulated annealing
- metaheuristic
- precedence constraints
- test problems
- optimization problems
- discrete optimization problems
- finding an optimal solution
- single machine scheduling problem
- branch and bound method
- vehicle routing problem
- traveling salesman
- valid inequalities
- lower bound
- network design problem
- ant colony optimization
- lagrangian relaxation
- hamiltonian cycle
- upper bound
- optimal solution
- np hard
- quadratic assignment problem
- neural network