An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem

Minh Anh Nguyen, Hai Long Luong, Minh Hoàng Hà +1

We propose an efficient branch-and-cut algorithm to exactly solve the parallel drone scheduling traveling salesman problem. Our algorithm can find optimal solutions for all but two…