The problem of packing equal spheres in a spherical container is a class...
The problem of packing equal circles in a circle is a classic and famous...
Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical
generaliz...
Maximum Common induced Subgraph (MCS) is an important NP-hard problem wi...
TSP is a classical NP-hard combinatorial optimization problem with many
...
We propose a new and strengthened Branch-and-Bound (BnB) algorithm for t...
We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical
g...
The two most effective branching strategies LRB and VSIDS perform differ...
We address the Traveling Salesman Problem (TSP), a famous NP-hard
combin...
Stochastic gradient descent (SGD) is a powerful method for large-scale
o...
Branch-and-bound (BnB) algorithms are widely used to solve combinatorial...
This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly...
Although Path-Relinking is an effective local search method for many
com...
Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SA...