A Parallel Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems.
Joseph F. PeknyDonald L. MillerPublished in: ACM Conference on Computer Science (1990)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- traveling salesman problem
- branch and bound
- discrete optimization problems
- combinatorial problems
- branch and bound method
- combinatorial optimization problems
- simulated annealing
- metaheuristic
- precedence constraints
- optimization problems
- finding an optimal solution
- max sat
- upper bounding
- single machine scheduling problem
- vehicle routing problem
- graph coloring
- lower bound
- variable ordering
- lagrangian relaxation
- hamiltonian cycle
- upper bound
- integer variables
- quadratic assignment problem
- satisfy the triangle inequality
- np hard
- distribution network
- ant colony optimization
- special case