A branch-and-bound algorithm for the double travelling salesman problem with two stacks.
Francesco CarrabsRaffaele CerulliMaria Grazia SperanzaPublished in: Networks (2013)
Keyphrases
- lagrangian relaxation
- branch and bound algorithm
- lower bound
- branch and bound
- quadratic assignment problem
- np hard
- upper bound
- optimal solution
- test problems
- lower bounding
- upper bounding
- combinatorial optimization
- single machine scheduling problem
- randomly generated problems
- mixed integer linear programming
- branch and bound method
- search algorithm
- precedence constraints
- maximum clique
- network design problem
- finding an optimal solution
- variable ordering
- neural network
- max sat
- scheduling problem
- knapsack problem
- constraint satisfaction problems
- partial order