Metaheuristics for the minimum gap graph partitioning problem
M Bruglieri, R Cordone - Computers & Operations Research, 2021 - Elsevier
Computers & Operations Research, 2021•Elsevier
Abstract The Minimum Gap Graph Partitioning Problem (MGGPP) consists in partitioning a
vertex-weighted undirected graph into a given number of connected subgraphs with the
minimum difference between the largest and the smallest weight in each subgraph. We
propose a two-level Tabu Search algorithm and an Adaptive Large Neighborhood Search
algorithm to solve the MGGPP in reasonable time on instances with up to about 23 000
vertices. The quality of the heuristic solutions is assessed comparing them with the solutions …
vertex-weighted undirected graph into a given number of connected subgraphs with the
minimum difference between the largest and the smallest weight in each subgraph. We
propose a two-level Tabu Search algorithm and an Adaptive Large Neighborhood Search
algorithm to solve the MGGPP in reasonable time on instances with up to about 23 000
vertices. The quality of the heuristic solutions is assessed comparing them with the solutions …
Abstract
The Minimum Gap Graph Partitioning Problem (MGGPP) consists in partitioning a vertex-weighted undirected graph into a given number of connected subgraphs with the minimum difference between the largest and the smallest weight in each subgraph. We propose a two-level Tabu Search algorithm and an Adaptive Large Neighborhood Search algorithm to solve the MGGPP in reasonable time on instances with up to about 23 000 vertices. The quality of the heuristic solutions is assessed comparing them with the solutions of a polynomially solvable combinatorial relaxation.
Elsevier
Showing the best result for this search. See all results
