Jiongzhi Zheng

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 29

Top Topics

Traveling Salesman

Traveling Salesman Problem

Hybrid Genetic Algorithm

Top Venues

Comput. Oper. Res.

Publications

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 (2024)
Jiongzhi Zheng, Zhuo Chen, Chu-Min Li, Kun He
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers. CoRR (2024)
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)
Jiongzhi Zheng, Jinghui Xue, Kun He, Chu-Min Li, Yanli Liu
An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems. CoRR (2024)
Yuxuan Wang, Jiongzhi Zheng, Jinyao Xie, Kun He
FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem. CoRR (2024)
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 (2024)
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 (2023)
Jiongzhi Zheng, Jialun Zhong, Menglei Chen, Kun He
A reinforced hybrid genetic algorithm for the traveling salesman problem. Comput. Oper. Res. 157 (2023)
Jiongzhi Zheng, Mingming Jin, Yan Jin, Kun He
Relaxed Graph Color Bound for the Maximum k-plex Problem. CoRR (2023)
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 (2023)
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 (2023)
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 (2023)
Jiongzhi Zheng, Kun He, Jianrong Zhou
Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers. AAAI (2023)
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 (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu Min Li, Felip Manyà
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. CoRR (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà
Incorporating Multi-armed Bandit with Local Search for MaxSAT. CoRR (2022)
Jiongzhi Zheng, Yawei Hong, Wenchang Xu, Wentao Li, Yongfu Chen
An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem. CoRR (2022)
Yuxuan Wang, Jinyao Xie, Jiongzhi Zheng, Kun He
An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem. CoRR (2022)
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)
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 (2022)
Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems. CoRR (2022)
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)
Jianrong Zhou, Jiongzhi Zheng, Kun He
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem. Int. J. Comput. Intell. Syst. 15 (1) (2022)
Jianrong Zhou, Jiongzhi Zheng, Kun He
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem. CoRR (2022)
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)
Jiongzhi Zheng, Menglei Chen, Jialun Zhong, Kun He
Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem. CoRR (2021)
Jiongzhi Zheng, Jianrong Zhou, Kun He
Farsighted Probabilistic Sampling based Local Search for (Weighted) Partial MaxSAT. CoRR (2021)
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 (2020)
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)