arrow
Return

Mathematical programming formulations for the Collapsed k-Core Problem

delete2023-11-01
delete2
delete
OA
AI
M
Martina Cerulli
D
Domenico Serra *
C
Carmine Sorgente
C
Claudia Archetti
I
Ivana Ljubić
DOI:10.1016/j.ejor.2023.04.038delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In social network analysis, the size of the k-core, i.e., the maximal induced subgraph of the network with minimum degree at least k , is frequently adopted as a typical metric to evaluate the cohesiveness of a community. We address the Collapsed k-Core Problem, which seeks to find a subset of b users, namely the most critical users of the network, the removal of which results in the smallest possible k core. For the first time, both the problem of finding the k-core of a network and the Collapsed k-Core Problem are formulated using mathematical programming. On the one hand, we model the Collapsed k-Core Problem as a natural deletion-round-indexed Integer Linear formulation. On the other hand, we provide two bilevel programs for the problem, which differ in the way in which the k-core identification problem is formulated at the lower level. The first bilevel formulation is reformulated as a single-level sparse model, exploiting a Benders-like decomposition approach. To derive the second bilevel model, we provide a linear formulation for finding the k-core and use it to state the lower-level problem. We then dualize the lower level and obtain a compact Mixed-Integer Nonlinear single-level problem reformulation. We additionally derive a combinatorial lower bound on the value of the optimal solution and describe some pre-processing procedures, and valid inequalities for the three formulations. The performance of the proposed formulations is compared on a set of benchmarking instances with the existing state-of-the-art solver for mixed-integer bilevel problems proposed in (Fischetti, Ljubi e, Monaci, and Sinnl, 2017).(c) 2023 Elsevier B.V. All rights reserved.
Keywords:
(O) combinatorial optimization
Bilevel optimization
Social networks
k-Core
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

U
University of Salerno
Scholars:
1.2W
Papers: 1.1W
Citations: 1.2W
E
ESSEC Business School
Scholars:
435
Papers: 750
Citations: 1