Algorithms based on Branch and Bound for the Flying Sidekick Traveling Salesman Problem