5 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 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.…