3 citations · 14 across the 18 of their papers we have counts for
18 papers
Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems
Long Wang, Jiongzhi Zheng, Zhengda Xiong +2
Algorithms designed for routing problems typically rely on high-quality candidate edges to guide their search, aiming to reduce the search space and enhance the search efficiency.…
Integer Linear Programming Preprocessing for Maximum Satisfiability
Jialu Zhang, Chu-Min Li, Sami Cherif +2
The Maximum Satisfiability problem (MaxSAT) is a major optimization challenge with numerous practical applications. In recent MaxSAT evaluations, most MaxSAT solvers have incorpora…
An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems
Jiongzhi Zheng, Jinghui Xue, Kun He +2
In many real-world problems and applications, finding only a single element, even though the best, among all possible candidates, cannot fully meet the requirements. We may wish to…
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers
Jiongzhi Zheng, Zhuo Chen, Chu-Min Li +1
MaxSAT is an optimization version of the famous NP-complete Satisfiability problem (SAT). Algorithms for MaxSAT mainly include complete solvers and local search incomplete solvers.…
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere
Jianrong Zhou, Shuo Ren, Kun He +2
The problem of packing equal spheres in a spherical container is a classic global optimization problem, which has attracted enormous studies in academia and found various applicati…
Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale
Jianrong Zhou, Kun He, Jiongzhi Zheng +1
The problem of packing equal circles in a circle is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. This prob…