2 citations · 6 across the 6 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.AI2025
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.…
cs.AI2025
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…