2 papers
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…
math.OC2018
2VRP: a benchmark problem for small but rich VRPs
Vladimir Deineko, Bettina Klinz
We consider a 2-vehicle routing problem (2VRP) which can be viewed as a building block for the variety of vehicle routing problems (VRP). As a simplified version of the 2VRP, we co…