Showing 31 - 37 of 37
Persistent link: https://www.econbiz.de/10010141433
Persistent link: https://www.econbiz.de/10010037324
Persistent link: https://www.econbiz.de/10013411775
Persistent link: https://www.econbiz.de/10014391700
Persistent link: https://www.econbiz.de/10013553018
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....
Persistent link: https://www.econbiz.de/10011190815
Persistent link: https://www.econbiz.de/10014534796