Minimizing cyclic cutwidth of graphs using a memetic algorithm

Improving efficiency of providing data group anonymity by automating data modification quality evaluation

“…In recent years, many novel applications of memetic algorithms have been proposed, especially in the area of solving complex optimization problems [22]. Such algorithms aim at solving the shortest path routing problem [23], minimum dominating set problem [24], minimum graph cutwidth problem [25], etc.…”