default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMing-Kong Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Xiao-Bing Hu, Sheng-Hao Gu, Chi Zhang, Gong-Peng Zhang
, Ming-Kong Zhang, Mark S. Leeson:
Finding all Pareto optimal paths by simulating ripple relay race in multi-objective networks. Swarm Evol. Comput. 64: 100908 (2021)- 2020
- [j2]Xiao-Bing Hu, Chi Zhang, Gong-Peng Zhang, Ming-Kong Zhang, Hang Li, Mark S. Leeson, Jian-Qin Liao:
Finding the k shortest paths by ripple-spreading algorithms. Eng. Appl. Artif. Intell. 87 (2020)
2010 – 2019
- 2019
- [j1]Xiao-Bing Hu, Hailin Zhang, Chi Zhang, Ming-Kong Zhang, Hang Li, Mark S. Leeson:
A benchmark test problem toolkit for multi-objective path optimization. Swarm Evol. Comput. 44: 18-30 (2019) - 2018
- [c10]Xiao-Bing Hu, Hang Li, Jun Zhou, Ming-Kong Zhang, Jian-Qin Liao:
Finding all Pareto Optimal Paths for Dynamical Multi-Objective Path optimization Problems. SSCI 2018: 965-972 - [c9]Xiao-Bing Hu, Jun Zhou, Hang Li, Ming-Kong Zhang:
Finding the k Shortest Paths for Co-Evolutionary Path Optimization. SSCI 2018: 1906-1912 - 2017
- [c8]Xiao-Bing Hu, Ming-Kong Zhang, Di Hu:
An approximate ripple-spreading algorithm to identify the k best paths. ICNC-FSKD 2017: 481-486 - [c7]Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao:
A ripple-spreading algorithm for calculating weighted betweenness in networks. ICNC-FSKD 2017: 911-917 - [c6]Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao:
An approximate ripple-spreading algorithm with terminal h strategy. SSCI 2017: 1-8 - 2016
- [c5]Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao, Hailin Zhang:
An effective method to find the k shortest paths in a generalized time-window network. CEC 2016: 2345-2351 - [c4]Xiao-Bing Hu, Ming-Kong Zhang, Di Hu:
Improving the computational efficiency of ripple-spreading algorithm for the k shortest paths problem. CEC 2016: 2604-2609 - [c3]Ming-Kong Zhang, Xiao-Bing Hu, Jian-Qin Liao:
A new path optimization method in dynamic adverse weathers. ICNC-FSKD 2016: 370-375 - [c2]Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao, Hailin Zhang:
A ripple-spreading algorithm to calculate the k shortest paths in a network with time-windows. ICNC-FSKD 2016: 376-382 - [c1]Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao:
A ripple-spreading algorithm for network performance assessment. SSCI 2016: 1-8
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 22:15 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:
