Similar Search Results

The Steiner Traveling Salesman Problem with online edge blockages

Zhang, Huili; Tong, Weitian; Xu, Yinfeng; Lin, Guohui - In: European journal of operational research : EJOR 243 (2015) 1, pp. 30-40

Persistent link: https://www.econbiz.de/10010492335

The Steiner traveling salesman problem with online advanced edge blockages

Zhang, Huili; Tong, Weitian; Xu, Yinfeng; Lin, Guohui - In: Computers & operations research : and their … 70 (2016), pp. 26-38

Persistent link: https://www.econbiz.de/10011450196

Online crowdsourced truck delivery using historical information

Zhang, Huili; Luo, Kelin; Xu, Yao; Xu, Yinfeng; Tong, … - In: European journal of operational research : EJOR 301 (2022) 2, pp. 486-501

Persistent link: https://www.econbiz.de/10013207657

The k-Canadian Travelers Problem with communication

Zhang, Huili; Xu, Yinfeng; Qin, Lan - In: Journal of combinatorial optimization 26 (2013) 2, pp. 251-265

Persistent link: https://www.econbiz.de/10009778604

Online minimum latency problem with edge uncertainty

Zhang, Huili; Tong, Weitian; Lin, Guohui; Xu, Yinfeng - In: European journal of operational research : EJOR 273 (2019) 2, pp. 418-429

Persistent link: https://www.econbiz.de/10011987522

Online generalized assignment problem with historical information

Liu, Haodong; Zhang, Huili; Luo, Kelin; Xu, Yao; Xu, Yinfeng - In: Computers & operations research : and their … 149 (2023), pp. 1-19

Persistent link: https://www.econbiz.de/10013461095

The k-Canadian Travelers Problem with communication

Zhang, Huili; Xu, Yinfeng; Qin, Lan - In: Journal of combinatorial optimization 26 (2013) 2, pp. 251-265

Persistent link: https://www.econbiz.de/10010141433

Online traveling salesman problem with deadline and advanced information

Wen, Xingang; Xu, Yinfeng; Zhang, Huili - In: Computers & industrial engineering : CAIE ; an … 63 (2012) 4, pp. 1048-1054

Persistent link: https://www.econbiz.de/10010037324

The Steiner Traveling Salesman Problem with online edge blockages

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....

Persistent link: https://www.econbiz.de/10011190815