default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiangyong Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c7]Xiangyong Li, Tao Xiang, Yigong Xie, Yang Lyu, Jinding He, Guangdi Chen:
Calibrations of Ten-Meter Wind Speed Prediction over the Yunnan-Kweichow Plateau Based on the U-Net Neural Network. ICISCAE 2023: 293-296- 2022
- [j22]Dapei Jiang, Xiangyong Li, Yash P. Aneja, Wei Wang
, Peng Tian:
Integrating order delivery and return operations for order fulfillment in an online retail environment. Comput. Oper. Res. 143: 105749 (2022) - 2021
- [j21]Justin Britt, Md. Fazle Baki, Ahmed Azab, Abderrahmane Chaouch, Xiangyong Li:
A stochastic hierarchical approach for the master surgical scheduling problem. Comput. Ind. Eng. 158: 107385 (2021) - [j20]Dapei Jiang, Xiangyong Li:
Order fulfilment problem with time windows and synchronisation arising in the online retailing. Int. J. Prod. Res. 59(4): 1187-1215 (2021) - 2020
- [j19]Xiangyong Li, Yash P. Aneja:
A new branch-and-cut approach for the generalized regenerator location problem. Ann. Oper. Res. 295(1): 229-255 (2020) - [j18]Xiangyong Li, Yash P. Aneja:
A Branch-And-Benders-Cut approach for the fault tolerant regenerator location problem. Comput. Oper. Res. 115: 104847 (2020)
2010 – 2019
- 2019
- [j17]Xiaolu Tian, Yutian Chong, Yutao Huang, Pi Guo, Mengjie Li, Wangjian Zhang, Zhicheng Du, Xiangyong Li, Yuantao Hao:
Using Machine Learning Algorithms to Predict Hepatitis B Surface Antigen Seroclearance. Comput. Math. Methods Medicine 2019: 6915850:1-6915850:7 (2019) - [j16]Xiangyong Li, Jieqi Li, Yash P. Aneja, Zhaoxia Guo, Peng Tian:
Integrated order allocation and order routing problem for e-order fulfillment. IISE Trans. 51(10): 1128-1150 (2019) - 2018
- [j15]Xiangyong Li, Chongfang Yue, Yash P. Aneja, Si Chen, Youzhi Cui:
An Iterated Tabu Search Metaheuristic for the Regenerator Location Problem. Appl. Soft Comput. 70: 182-194 (2018) - [j14]Xiangyong Li, Lanjian Zhu, Md. Fazle Baki, Ben A. Chaouch:
Tabu search and iterated local search for the cyclic bottleneck assignment problem. Comput. Oper. Res. 96: 120-130 (2018) - 2017
- [j13]Xiangyong Li, Shaochong Lin, Si Chen, Yash P. Aneja, Peng Tian, Youzhi Cui:
An iterated metaheuristic for the directed network design problem with relays. Comput. Ind. Eng. 113: 35-45 (2017) - [j12]Xiangyong Li, Kai Wei, Yash P. Aneja, Peng Tian, Youzhi Cui:
Matheuristics for the single-path design-balanced service network design problem. Comput. Oper. Res. 77: 141-153 (2017) - [j11]Xiangyong Li, Yash P. Aneja:
Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms. Eur. J. Oper. Res. 257(1): 25-40 (2017) - 2014
- [j10]Shun Liu, Xiangyong Li, Jie Yang, Zhihong Zhang:
Low False-Positives in an mLumin-Based Bimolecular Fluorescence Complementation System with a Bicistronic Expression Vector. Sensors 14(2): 3284-3292 (2014) - 2012
- [j9]Xiangyong Li, Stephen C. H. Leung, Peng Tian:
A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Syst. Appl. 39(1): 365-374 (2012) - [j8]Xiangyong Li, Yash P. Aneja:
A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks. INFORMS J. Comput. 24(3): 443-456 (2012) - [j7]Xiangyong Li, Zhiyong Cheng, Honglin Jin:
Dynamics of Ras Complexes Observed in Living Cells. Sensors 12(7): 9411-9422 (2012) - 2011
- [j6]Xiangyong Li, Md. Fazle Baki, Yash P. Aneja:
Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic. Comput. Oper. Res. 38(1): 152-164 (2011) - 2010
- [j5]Xiangyong Li, Md. Fazle Baki, Yash P. Aneja:
An ant colony optimization metaheuristic for machine-part cell formation problems. Comput. Oper. Res. 37(12): 2071-2081 (2010) - [j4]Yash P. Aneja, Ramaswamy Chandrasekaran, Xiangyong Li, K. P. K. Nair:
A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks. Eur. J. Oper. Res. 204(3): 604-612 (2010) - [j3]Xiangyong Li, Yash P. Aneja, Md. Fazle Baki:
An ant colony optimization metaheuristic for single-path multicommodity network flow problems. J. Oper. Res. Soc. 61(9): 1340-1355 (2010)
2000 – 2009
- 2009
- [j2]Kanchan Das, Md. Fazle Baki, Xiangyong Li:
Optimization of operation and changeover time for production planning and scheduling in a flexible manufacturing system. Comput. Ind. Eng. 56(1): 283-293 (2009) - [j1]Xiangyong Li, Peng Tian, Stephen C. H. Leung:
An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems. J. Oper. Res. Soc. 60(7): 1012-1025 (2009) - [c6]Xiangyong Li, Yash P. Aneja:
A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks. COCOA 2009: 494-506 - 2008
- [c5]Xiangyong Li, Yash P. Aneja, Md. Fazle Baki:
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks. COCOA 2008: 235-245 - 2006
- [c4]Xiangyong Li, Peng Tian:
An Ant Colony System for the Open Vehicle Routing Problem. ANTS Workshop 2006: 356-363 - [c3]Xiangyong Li, Peng Tian, Xiaoping Min:
A Hierarchical Particle Swarm Optimization for Solving Bilevel Programming Problems. ICAISC 2006: 1169-1178 - [c2]Xiangyong Li, Peng Tian, Jing Hua, Ning Zhong:
A Hybrid Discrete Particle Swarm Optimization for the Traveling Salesman Problem. SEAL 2006: 181-188 - 2005
- [c1]Xiangyong Li, Peng Tian, Min Kong:
A Novel Particle Swarm Optimization for Constrained Optimization Problems. Australian Conference on Artificial Intelligence 2005: 1305-1310
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
