Jiongzhi Zheng

According to our database, Jiongzhi Zheng authored at least 18 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2024

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum s-Bundle Problem.

Jinghui Xue, Jiongzhi Zheng, Mingming Jin, Kun He

CoRR, 2024

Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers.

Jiongzhi Zheng, Zhuo Chen, Chu-Min Li, Kun He

CoRR, 2024

KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem.

Mingming Jin, Jiongzhi Zheng, Kun He

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

A reinforced hybrid genetic algorithm for the traveling salesman problem.

Jiongzhi Zheng, Jialun Zhong, Menglei Chen, Kun He

Comput. Oper. Res., September, 2023

A Simulated Annealing approach for the Circle Bin Packing Problem with Rectangular Items.

Kevin Tole, Rashad Moqa, Jiongzhi Zheng, Kun He

Comput. Ind. Eng., February, 2023

Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems.

Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li

Knowl. Based Syst., 2023

Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale.

Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li

CoRR, 2023

Relaxed Graph Color Bound for the Maximum k-plex Problem.

Jiongzhi Zheng, Mingming Jin, Yan Jin, Kun He

CoRR, 2023

Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers.

Jiongzhi Zheng, Kun He, Jianrong Zhou

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem.

Jianrong Zhou, Jiongzhi Zheng, Kun He

Int. J. Comput. Intell. Syst., 2022

Incorporating Multi-armed Bandit with Local Search for MaxSAT.

Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà

CoRR, 2022

An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem.

Yuxuan Wang, Jinyao Xie, Jiongzhi Zheng, Kun He

CoRR, 2022

An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem.

Jiongzhi Zheng, Yawei Hong, Wenchang Xu, Wentao Li, Yongfu Chen

Comput. Oper. Res., 2022

A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem.

Jianrong Zhou, Kun He, Jiongzhi Zheng, Chu-Min Li, Yanli Liu

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit.

Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Farsighted Probabilistic Sampling based Local Search for (Weighted) Partial MaxSAT.

Jiongzhi Zheng, Jianrong Zhou, Kun He

CoRR, 2021

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem.

Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2019

A Novel and Fine-grained Heap Randomization Allocation Strategy for Effectively Alleviating Heap Buffer Overflow Vulnerabilities.

Zhiyong Jin, Yongfu Chen, Tian Liu, Kai Li, Zhenting Wang, Jiongzhi Zheng

Proceedings of the 4th International Conference on Mathematics and Artificial Intelligence, 2019