We 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.
A metaheuristic for the Minimum Gap Graph Partitioning Problem
M. Bruglieri;R. Cordone;
2017-01-01
Abstract
We 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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
MGGPP_CTW2017.pdf
Accesso riservato
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
171.89 kB
Formato
Adobe PDF
|
171.89 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
