research
∙
08/14/2023
KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
The Maximum k-Defective Clique Problem (MDCP) aims to find a maximum k-d...
share
research
∙
03/05/2023
Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale
The problem of packing equal circles in a circle is a classic and famous...
research
∙
01/18/2023
Relaxed Graph Color Bound for the Maximum k-plex Problem
As a relaxation of the clique, a k-plex of a graph is a vertex set that ...
research
∙
11/29/2022
Incorporating Multi-armed Bandit with Local Search for MaxSAT
Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generaliz...
research
∙
07/08/2022
Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems
TSP is a classical NP-hard combinatorial optimization problem with many ...
research
∙
02/07/2022
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem
We address the Budgeted Maximum Coverage Problem (BMCP), which is a natu...
research
∙
01/25/2022
An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem
The Partitioning Min-Max Weighted Matching (PMMWM) problem is an NP-hard...
research
∙
01/24/2022
An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem
The multiple Traveling Salesmen Problem mTSP is a general extension of t...
research
∙
01/17/2022
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
We propose a new and strengthened Branch-and-Bound (BnB) algorithm for t...
research
∙
01/14/2022
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit
We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical g...
research
∙
08/23/2021
Farsighted Probabilistic Sampling based Local Search for (Weighted) Partial MaxSAT
Partial MaxSAT (PMS) and Weighted Partial MaxSAT (WPMS) are both practic...
research
∙
07/09/2021
Reinforced Hybrid Genetic Algorithm for the Traveling Salesman Problem
We propose a powerful Reinforced Hybrid Genetic Algorithm (RHGA) for the...
research
∙
12/08/2020