research
∙
05/17/2023
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere
The problem of packing equal spheres in a spherical container is a class...
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
∙
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/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
∙
12/08/2020
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem
We address the Traveling Salesman Problem (TSP), a famous NP-hard combin...
research
∙
01/22/2020
Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem
Stochastic gradient descent (SGD) is a powerful method for large-scale o...
research
∙
06/26/2018