collaborators

1 paper

math.OC2022

2-Period Balanced Travelling Salesman Problem: a polynomially solvable case and heuristics

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…