2 citations · 5 across the 12 of their papers we have counts for
1 paper · 2 filters
Vladimir Deineko, Bettina Klinz, Mengke Wang
We consider the NP-hard 2-period balanced travelling salesman problem. In this problem the salesman needs to visit a set of customers in two time periods. A given subset of the cus…