The minimum weight vertex cover (MWVC) problem is an important combinatorial
optimization problem with various real-world applications. Due to its NP hardness, most …

The minimum weight vertex cover (MWVC) problem is a well known NP-hard problem with
various real-world applications. In this paper, we design an efficient algorithm named …

Minimum vertex cover problem (MVC) is a classic combinatorial optimization problem, which
has many critical real-life applications in scheduling, VLSI design, artificial intelligence, and …

Since the membrane algorithm was proposed, it has been used for many optimization
problems such as, traveling salesman problem, the knapsack problem, and so on. In …

The minimum vertex cover problem (MVCP) and minimum weighted vertex cover problem
(MWVCP) have been used in a variety of applications. This paper focuses on a view of test …

In the NP-hard Max $ c $-Cut problem, one is given an undirected edge-weighted graph $ G
$ and aims to color the vertices of $ G $ with $ c $ colors such that the total weight of edges …

A k-swap W for a vertex cover S of a graph G is a vertex set of size at most k such that S'=(S⧵
W)∪(W⧵ S), the symmetric difference of S and W, is a vertex cover of G. If| S'|<| S|, then W is …

Cluster Editing is the problem of finding the minimum number of edge-modifications that
transform a given graph G into a cluster graph G', that is, each connected component of G'is …

Local search problems consist of a set of feasible solutions, an objective function, and a
neighborhood relation which assigns to each feasible solution a set of neighbors. A solution …

Abstract Maximum Satisfiability (MaxSAT) is a general model for formulating combinatorial
optimization problems. MaxSAT formulas encoded from different domains have different …