Local search method is a rising star for solving combinatorial optimization problems in recent years, and many state-of-the-art local search-based incomplete Maximum Satisfiability (MaxSAT) solvers ...
Clique relaxation problems are important extension versions of the maximum clique problem with extensive real-world applications. Although lots of studies focus on designing local search algorithms ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results