default search action
Rong-Qiang Zeng
2020 – today
- 2024
- [c18]Rong-Qiang Zeng, Matthieu Basseur, Li-Yuan Xue:
Multi-objective Path Relinking Algorithm for Solving Bi-objective Flowshop Scheduling Problem. ICIC (1) 2024: 159-168 - 2023
- [c17]Rong-Qiang Zeng, Li-Yuan Xue, Matthieu Basseur:
Detecting Community Structure in Complex Networks with Backbone Guided Search Algorithm. ICIC (1) 2023: 59-67 - 2022
- [c16]Rong-Qiang Zeng, Matthieu Basseur:
Neighborhood Combination Strategies for Solving the Bi-objective Max-Bisection Problem. ICIC (1) 2022: 123-131
2010 – 2019
- 2019
- [c15]Rong-Qiang Zeng, Li-Yuan Xue:
A Percolation Algorithm to Discover Emerging Research Topics. ICIC (1) 2019: 491-500 - [c14]Zheng-Yin Hu, Rong-Qiang Zeng, Lin Peng, Hongseng Pang, Xiao-Chu Qin, Cheng Guo:
Discovering Emerging Research Topics Based on SPO Predications. KMO 2019: 110-121 - 2018
- [c13]Li-Yuan Xue, Rong-Qiang Zeng, Haiyun Xu, Yi Wen:
Solving Bi-criteria Maximum Diversity Problem with Multi-objective Multi-level Algorithm. ICIC (3) 2018: 54-62 - [c12]Zheng-Yin Hu, Rong-Qiang Zeng, Xiao-Chu Qin, Ling Wei, Zhiqiang Zhang:
A Method of Biomedical Knowledge Discovery by Literature Mining Based on SPO Predications: A Case Study of Induced Pluripotent Stem Cells. MLDM (2) 2018: 383-393 - 2017
- [c11]Li-Yuan Xue, Rong-Qiang Zeng, Haiyun Xu, Zheng-Yin Hu, Yi Wen:
Hypervolume-Based Multi-level Algorithm for the Bi-criteria Max-Cut Problem. BIC-TA 2017: 456-465 - [c10]Rong-Qiang Zeng, Hong-Shen Pang, Xiao-Chu Qin, Yi-Bing Song, Yi Wen, Zheng-Yin Hu, Ning Yang, Hong-Mei Guo, Qian Li:
Mining Hot Research Topics based on Complex Network Analysis - A Case Study on Regenerative Medicine. KDIR 2017: 263-268 - [c9]Li-Yuan Xue, Rong-Qiang Zeng, Zheng-Yin Hu, Yi Wen:
Solving the Bi-criteria Max-Cut Problem with Different Neighborhood Combination Strategies. IDEAL 2017: 508-515 - [c8]Li-Yuan Xue, Rong-Qiang Zeng, Wei An, Qing-Xian Wang, Mingsheng Shang:
Experiments on Neighborhood Combination Strategies for Bi-objective Unconstrained Binary Quadratic Programming Problem. PAAP 2017: 444-453 - 2016
- [c7]Chao Huo, Rong-Qiang Zeng, Yang Wang, Mingsheng Shang:
A Multi-parent Crossover Based Genetic Algorithm for Bi-Objective Unconstrained Binary Quadratic Programming Problem. BIC-TA (2) 2016: 10-19 - [c6]Li-Yuan Xue, Rong-Qiang Zeng, Yang Wang, Mingsheng Shang:
Solving Bi-objective Unconstrained Binary Quadratic Programming Problem with Multi-objective Backbone Guided Search Algorithm. ICIC (2) 2016: 745-753 - [c5]Lei Song, Rong-Qiang Zeng, Yang Wang, Mingsheng Shang:
Solving bi-objective unconstrained binary quadratic programming problem with multi-objective path relinking algorithm. ICNC-FSKD 2016: 289-293 - [c4]Chao Huo, Rong-Qiang Zeng, Yang Wang, Mingsheng Shang:
An Effective Genetic Algorithm with Uniform Crossover for Bi-objective Unconstrained Binary Quadratic Programming Problem. IDEAL 2016: 58-67 - 2014
- [c3]Rong-Qiang Zeng, Ming-Sheng Shang:
Solving Three-Objective Flow Shop Problem with Fast Hypervolume-Based Local Search Algorithm. ICIC (2) 2014: 11-25 - [c2]Rong-Qiang Zeng, Ming-Sheng Shang:
Solving bi-objective flow shop problem with multi-objective path relinking algorithm. ICNC 2014: 343-348 - 2013
- [j2]Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao:
Solving bi-objective flow shop problem with hybrid path relinking algorithm. Appl. Soft Comput. 13(10): 4118-4132 (2013) - [c1]Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao:
Hypervolume-Based Multi-Objective Path Relinking Algorithm. EMO 2013: 185-199 - 2012
- [j1]Matthieu Basseur, Rong-Qiang Zeng, Jin-Kao Hao:
Hypervolume-based multi-objective local search. Neural Comput. Appl. 21(8): 1917-1929 (2012)
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.
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.
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.
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-12-26 00:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint