.png){kind=icon}
.png){kind=icon}
Return
Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2024.02.033.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper deals with the k-way normalized cut problem in complex networks. It presents a methodology that uses mathematical optimization to provide mixed-integer linear programming formulations for the problem. The paper also develops a branch-and-price algorithm for the above-mentioned problem which scales better than the compact formulations. Additionally, a heuristic algorithm which is able to approximate largescale image problems in those cases where the exact methods are not applicable is presented. Extensive computational experiments assess the usefulness of these methods to solve the k-way normalized cut problem. Finally, we have applied the minimum normalized cut objective function to the segmentation of actual images, showing the applicability of the introduced methodology.
Keywords:
Complex networks detection
Community detection
Mathematical programming
Image segmentation
Normalized cuts
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W