A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems.
Joseph F. PeknyDonald L. MillerPublished in: Math. Program. (1992)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- traveling salesman problem
- branch and bound
- combinatorial problems
- combinatorial optimization problems
- discrete optimization problems
- metaheuristic
- branch and bound method
- finding an optimal solution
- variable ordering
- simulated annealing
- precedence constraints
- optimization problems
- quadratic assignment problem
- single machine scheduling problem
- upper bounding
- max sat
- hamiltonian cycle
- lagrangian relaxation
- vehicle routing problem
- integer variables
- lower bound
- upper bound
- graph coloring
- distribution network
- optimal solution
- linear programming
- column generation
- constraint satisfaction problems
- np hard
- special case
- search algorithm