.png){kind=icon}
.png){kind=icon}
Return
An exact algorithm for the Minimum Gap Graph Partitioning Problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2025.107224.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• The sum of the maximum weight differences over all components is minimized. • Branch-and-bound based on an extended formulation of the problem. • Branching scheme keeping the quadratic number of variables. • Covering-packing relaxation vs Lagrangian relaxation. • Instances up to 300 vertices solved near-optimally with a metaheuristic support.
Keywords:
Graph partitioning
Branch-and-bound
Lagrangian relaxation
Set covering
Reduction procedures
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W