metaheuristic

Finding weaknesses in networks using Greedy Randomized Adaptive Search Procedure and Path Relinking

An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems