An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading.
Francesco CarrabsRaffaele CerulliJean-François CordeauPublished in: INFOR Inf. Syst. Oper. Res. (2007)
Keyphrases
- branch and bound algorithm
- heavy traffic
- lower bound
- branch and bound
- asymptotically optimal
- upper bound
- optimal solution
- queueing networks
- test problems
- steady state
- lower bounding
- long run
- np hard
- randomly generated problems
- search tree
- mixed integer linear programming
- precedence constraints
- combinatorial optimization
- arrival rate
- upper bounding
- variable ordering
- queue length
- single server
- call center
- single machine scheduling problem
- lagrangian relaxation
- linear programming
- branch and bound method
- max sat
- approximation algorithms
- finding an optimal solution
- maximum clique
- search algorithm