The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm.
Agha Iqbal AliJeff L. KenningtonPublished in: Discret. Appl. Math. (1986)
Keyphrases
- branch and bound algorithm
- lower bound
- traveling salesman problem
- combinatorial optimization
- branch and bound
- randomly generated
- np hard
- test problems
- upper bound
- optimal solution
- linear programming
- lower bounding
- limited capacity
- set covering problem
- search tree
- precedence constraints
- randomly generated problems
- lagrangian relaxation
- branch and bound method
- single machine scheduling problem
- upper bounding
- max sat
- search algorithm
- metaheuristic
- mixed integer linear programming
- variable ordering
- integer variables
- finding an optimal solution
- simulated annealing
- routing problem
- ant colony optimization
- optimization problems
- similarity measure
- neural network