3 citations · 7 across the 15 of their papers we have counts for
16 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.…
Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
Long Wang, Jiongzhi Zheng, Zhengda Xiong +1
The Lin-Kernighan-Helsguan (LKH) heuristic is a classic local search algorithm for the Traveling Salesman Problem (TSP). LKH introduces an -value to replace the traditional dist…
FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem
Yuxuan Wang, Jiongzhi Zheng, Jinyao Xie +1
The Partitioning Min-Max Weighted Matching (PMMWM) problem, being a practical NP-hard problem, integrates the task of partitioning the vertices of a bipartite graph into disjoint s…
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…
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum -Bundle Problem
Jinghui Xue, Jiongzhi Zheng, Mingming Jin +1
The Maximum s-Bundle Problem (MBP) addresses the task of identifying a maximum s-bundle in a given graph. A graph G=(V, E) is called an s-bundle if its vertex connectivity is at le…
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.…
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
The Maximum k-Defective Clique Problem (MDCP) aims to find a maximum k-defective clique in a given graph, where a k-defective clique is a relaxation clique missing at most k edges.…
Two New Upper Bounds for the Maximum k-plex Problem
Jiongzhi Zheng, Mingming Jin, Kun He
A k-plex in a graph is a vertex set where each vertex is non-adjacent to at most k vertices (including itself) in this set, and the Maximum k-plex Problem (MKP) is to find the larg…
Incorporating Multi-armed Bandit with Local Search for MaxSAT
Jiongzhi Zheng, Kun He, Jianrong Zhou +3
Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generalizations of the MaxSAT problem. In this paper, we propose a local search algorithm for these problems, called…
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems
Jiongzhi Zheng, Kun He, Jianrong Zhou +2
TSP is a classical NP-hard combinatorial optimization problem with many practical variants. LKH is one of the state-of-the-art local search algorithms for the TSP. LKH-3 is a power…
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem
Jianrong Zhou, Jiongzhi Zheng, Kun He
We address the Budgeted Maximum Coverage Problem (BMCP), which is a natural and more practical extension of the standard 0-1 knapsack problem and the set cover problem. Given m ele…
An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem
Yuxuan Wang, Jinyao Xie, Jiongzhi Zheng +1
The Partitioning Min-Max Weighted Matching (PMMWM) problem is an NP-hard problem that combines the problem of partitioning a group of vertices of a bipartite graph into disjoint su…
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
Jianrong Zhou, Kun He, Jiongzhi Zheng +2
We propose a new and strengthened Branch-and-Bound (BnB) algorithm for the maximum common (connected) induced subgraph problem based on two new operators, Long-Short Memory (LSM) a…
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit
Jiongzhi Zheng, Kun He, Jianrong Zhou +3
We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical generalizations of the MaxSAT problem, and propose a local search algorithm for these problems, called BandMa…
Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers
Jiongzhi Zheng, Kun He, Jianrong Zhou
Local search has been demonstrated as an efficient approach for two practical generalizations of the MaxSAT problem, namely Partial MaxSAT (PMS) and Weighted PMS (WPMS). In this wo…
Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem
Jiongzhi Zheng, Jialun Zhong, Menglei Chen +1
In this paper, we propose a new method called the Reinforced Hybrid Genetic Algorithm (RHGA) for solving the famous NP-hard Traveling Salesman Problem (TSP). Specifically, we combi…