default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiongzhi Zheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j6]Jianrong Zhou, Kun He
, Jiongzhi Zheng, Chu-Min Li:
Geometric batch optimization for packing equal circles in a circle on large scale. Expert Syst. Appl. 250: 123952 (2024)- 2023
- [j5]Kevin Tole, Rashad Moqa, Jiongzhi Zheng, Kun He:
A Simulated Annealing approach for the Circle Bin Packing Problem with Rectangular Items. Comput. Ind. Eng. 176: 109004 (2023) - [j4]Jiongzhi Zheng, Jialun Zhong, Menglei Chen, Kun He:
A reinforced hybrid genetic algorithm for the traveling salesman problem. Comput. Oper. Res. 157: 106249 (2023) - [j3]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li:
Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems. Knowl. Based Syst. 260: 110144 (2023) - 2022
- [j2]Jiongzhi Zheng, Yawei Hong, Wenchang Xu, Wentao Li, Yongfu Chen:
An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem. Comput. Oper. Res. 143: 105772 (2022) - [j1]Jianrong Zhou, Jiongzhi Zheng, Kun He:
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem. Int. J. Comput. Intell. Syst. 15(1): 43 (2022)
Conference and Workshop Papers
- 2024
- [c8]Mingming Jin, Jiongzhi Zheng, Kun He:
KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem. AAAI 2024: 20735-20742 - [c7]Jinghui Xue, Jiongzhi Zheng, Kun He, Chu-Min Li, Yanli Liu:
DiverTEAM: An Effective Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems. ECAI 2024: 4108-4115 - [c6]Jiongzhi Zheng, Zhuo Chen, Chu-Min Li, Kun He:
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers. IJCAI 2024: 1989-1997 - 2023
- [c5]Jiongzhi Zheng, Kun He, Jianrong Zhou:
Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers. AAAI 2023: 4132-4139 - 2022
- [c4]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà:
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. IJCAI 2022: 1901-1907 - [c3]Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu:
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem. IJCAI 2022: 1908-1914 - 2021
- [c2]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li:
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. AAAI 2021: 12445-12452 - 2019
- [c1]Zhiyong Jin, Yongfu Chen, Tian Liu, Kai Li, Zhenting Wang, Jiongzhi Zheng:
A Novel and Fine-grained Heap Randomization Allocation Strategy for Effectively Alleviating Heap Buffer Overflow Vulnerabilities. ICMAI 2019: 115-122
Informal and Other Publications
- 2024
- [i17]Jiongzhi Zheng, Zhuo Chen, Chu-Min Li, Kun He:
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers. CoRR abs/2401.10589 (2024) - [i16]Jinghui Xue, Jiongzhi Zheng, Mingming Jin, Kun He:
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum s-Bundle Problem. CoRR abs/2402.03736 (2024) - [i15]Jiongzhi Zheng, Jinghui Xue, Kun He, Chu-Min Li, Yanli Liu:
An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems. CoRR abs/2404.09997 (2024) - [i14]Yuxuan Wang, Jiongzhi Zheng, Jinyao Xie, Kun He:
FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem. CoRR abs/2405.03176 (2024) - 2023
- [i13]Jiongzhi Zheng, Mingming Jin, Yan Jin, Kun He:
Relaxed Graph Color Bound for the Maximum k-plex Problem. CoRR abs/2301.07300 (2023) - [i12]Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li:
Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale. CoRR abs/2303.02650 (2023) - [i11]Jiongzhi Zheng, Mingming Jin, Kun He:
KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem. CoRR abs/2308.07235 (2023) - 2022
- [i10]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu Min Li, Felip Manyà:
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. CoRR abs/2201.05544 (2022) - [i9]Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu:
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem. CoRR abs/2201.06252 (2022) - [i8]Jiongzhi Zheng, Yawei Hong, Wenchang Xu, Wentao Li, Yongfu Chen:
An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem. CoRR abs/2201.09424 (2022) - [i7]Yuxuan Wang, Jinyao Xie, Jiongzhi Zheng, Kun He:
An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem. CoRR abs/2201.10049 (2022) - [i6]Jianrong Zhou, Jiongzhi Zheng, Kun He:
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem. CoRR abs/2202.03093 (2022) - [i5]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li:
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems. CoRR abs/2207.03876 (2022) - [i4]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà:
Incorporating Multi-armed Bandit with Local Search for MaxSAT. CoRR abs/2211.16011 (2022) - 2021
- [i3]Jiongzhi Zheng, Menglei Chen, Jialun Zhong, Kun He:
Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem. CoRR abs/2107.06870 (2021) - [i2]Jiongzhi Zheng, Jianrong Zhou, Kun He:
Farsighted Probabilistic Sampling based Local Search for (Weighted) Partial MaxSAT. CoRR abs/2108.09988 (2021) - 2020
- [i1]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li:
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. CoRR abs/2012.04461 (2020)
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-30 21:36 CET 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:
