Zhang, Huili; Tong, Weitian; Xu, Yinfeng; Lin, Guohui - In: European Journal of Operational Research 243 (2015) 1, pp. 30-40
We consider the online Steiner Traveling Salesman Problem. In this problem, we are given an edge-weighted graph G = (V, E) and a subset D⊆V of destination vertices, with the optimization goal to find a minimum weight closed tour that traverses every destination vertex of D at least once....
