Zhou Xu, Liang Xu, and Chung-Lun Li, “Approximation Results for Min-max Path Cover Problems in Vehicle Routing”, Naval Research Logistics, 57: 728–748, 2010. (SCI. SWUFE B journal)
Zhou Xu, Liang Xu, and Brian Rodrigues, ”An analysis of the extended Christofides heuristic for the k-depot TSP”, Operational Research Letters, 39(3):218–223,2011 (SCI, SWUFE B journal)
Liang Xu, Zhou Xu, and Dongsheng Xu, “Exact and Approximation Algorithms for the Min-max k-Traveling Salesman Problem on a Tree”, European Journal of Operational Research, in press, 2013 (SCI, SWUFE A Journal)
Anbo Xiang, Liang Xu, and Baozhuang Niu," Knapsck-model-based Schemes and WLB Algorithm for the capacity and Efficiency Management of Web Cache",International Journal of Computers, Communications& Control 8(4),2013.(SCI, SWUFE C Journal)
会议论文 (部分)
Liang Xu and Zhou Xu, 2009,” Approximation Algorithms for Min-max Path Cover Problems with Service Handling Time”. Proceedings of The 20th International Symposium on Algorithms and Computation. （EI）
Liang Xu and Zhou Xu, 2009,” Approximation Algorithms for Min-max Path Cover Problems with Service Handling Time”. Proceedings of The 20th International Symposium on Algorithms and Computation. （EI）
扫码加好友，拉您进群
全部版块
我的主页
收藏
