Add to ORKGWe address the min-sum version of the Minimum Gap Graph Partitioning Problem through a Tabu Search metaheuristic. We also develop a Mixed Integer Linear Programming formulation to evaluate the quality of the solutions found by the Tabu Search on a set of benchmark instances properly built
The Graph Partitioning Problem (GPP) is one of the most studied NP-complete problems notable for its...
New heuristic algorithms are proposed for the Graph Partitioning problem. A greedy construction sche...
Real optimization problems often involve not one, but multiple objectives, usually in conflict. In s...
We address the min-sum version of the Minimum Gap Graph Partitioning Problem through a Tabu Search m...
The Minimum Gap Graph Partitioning Problem (MGGPP) consists in partitioning a vertex-weighted undire...
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. T...
International audienceThe minimum conductance graph partitioning problem (MC-GPP) is to partition th...
We study the computational complexity and approximability for the problem of partitioning a vertex-w...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
International audienceThe graph partitioning is usually tackled as a single-objective optimization p...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
The Graph Partitioning Problem (GPP) is one of the most studied NP-complete problems notable for its...
New heuristic algorithms are proposed for the Graph Partitioning problem. A greedy construction sche...
Real optimization problems often involve not one, but multiple objectives, usually in conflict. In s...
We address the min-sum version of the Minimum Gap Graph Partitioning Problem through a Tabu Search m...
The Minimum Gap Graph Partitioning Problem (MGGPP) consists in partitioning a vertex-weighted undire...
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. T...
International audienceThe minimum conductance graph partitioning problem (MC-GPP) is to partition th...
We study the computational complexity and approximability for the problem of partitioning a vertex-w...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
International audienceThe graph partitioning is usually tackled as a single-objective optimization p...
We study various polynomial special cases for the problem of partitioning a vertex-weighted undirect...
The Graph Partitioning Problem (GPP) is one of the most studied NP-complete problems notable for its...
New heuristic algorithms are proposed for the Graph Partitioning problem. A greedy construction sche...
Real optimization problems often involve not one, but multiple objectives, usually in conflict. In s...