Search Results for author:
Found 9 papers, 4 papers with code
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
Exact algorithms for MBP mainly follow the branch-and-bound (BnB) framework, whose performance heavily depends on the quality of the upper bound on the cardinality of a maximum s-bundle and the initial lower bound with graph reduction.
Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers
In this paper, we propose to transfer the SPB constraint into the clause weighting system of the local search method, leading the algorithm to better solutions.
Incorporating Multi-armed Bandit with Local Search for MaxSAT
In this paper, we propose a local search algorithm for these problems, called BandHS, which applies two multi-armed bandits to guide the search directions when escaping local optima.
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems
LKH-3 is a powerful extension of LKH that can solve many TSP variants.
An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem
Each iteration of ITSHA consists of an initialization stage and an improvement stage.
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit
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 BandMaxSAT, that applies a multi-armed bandit model to guide the search direction.
Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers
In this work, we observe that most local search (W)PMS solvers usually flip a single variable per iteration.
Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem
In the hybrid algorithm, LKH can help EAX-GA improve the population by its effective local search, and EAX-GA can help LKH escape from local optima by providing high-quality and diverse initial solutions.
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem
We address the Traveling Salesman Problem (TSP), a famous NP-hard combinatorial optimization problem.
