Essec\Faculty\Model\Contribution {#2233 ▼
#_index: "academ_contributions"
#_id: "12200"
#_source: array:26 [
"id" => "12200"
"slug" => "12200-casting-light-on-the-hidden-bilevel-combinatorial-structure-of-the-capacitated-vertex-separator-problem 
12200-casting-light-on-the-hidden-bilevel-combinatorial-structure-of-the-capacitated-vertex-separato "
"yearMonth" => "2022-07"
"year" => "2022"
"title" => "Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator prob "
"description" => "FURINI, F., LJUBIC, I., MALAGUTI, E. et PARONUZZI, P. (2022). Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem. <i>Operations Research</i>, 70(4), pp. 2399–2420. FURINI, F., LJUBIC, I., MALAGUTI, E. et PARONUZZI, P. (2022). Casting light on the hidden bilevel co "
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "MALAGUTI Enrico"
]
3 => array:1 [
"name" => "PARONUZZI Paolo"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Networks/graphs"
1 => "Integer programming"
2 => "Benders decomposition"
3 => "Cutting plane"
]
"updatedAt" => "2022-09-12 16:07:53"
"publicationUrl" => "https://doi.org/10.1287/opre.2021.2110"
"publicationInfo" => array:3 [
"pages" => "2399–2420"
"volume" => "70"
"number" => "4"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Given an undirected graph, we study the capacitated vertex separator problem that asks to find a subset of vertices of minimum cardinality, the removal of which induces a graph having a bounded number of pairwise disconnected shores (subsets of vertices) of limited cardinality. The problem is of great importance in the analysis and protection of communication or social networks against possible viral attacks and for matrix decomposition algorithms. In this article, we provide a new bilevel interpretation of the problem and model it as a two-player Stackelberg game in which the leader interdicts the vertices (i.e., decides on the subset of vertices to remove), and the follower solves a combinatorial optimization problem on the resulting graph. This approach allows us to develop a computational framework based on an integer programming formulation in the natural space of the variables. Given an undirected graph, we study the capacitated vertex separator problem that asks to find a sub "
"en" => "Given an undirected graph, we study the capacitated vertex separator problem that asks to find a subset of vertices of minimum cardinality, the removal of which induces a graph having a bounded number of pairwise disconnected shores (subsets of vertices) of limited cardinality. The problem is of great importance in the analysis and protection of communication or social networks against possible viral attacks and for matrix decomposition algorithms. In this article, we provide a new bilevel interpretation of the problem and model it as a two-player Stackelberg game in which the leader interdicts the vertices (i.e., decides on the subset of vertices to remove), and the follower solves a combinatorial optimization problem on the resulting graph. This approach allows us to develop a computational framework based on an integer programming formulation in the natural space of the variables. Given an undirected graph, we study the capacitated vertex separator problem that asks to find a sub "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-02T12:21:45.000Z"
"docTitle" => "Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator prob "
"docSurtitle" => "Articles"
"authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, FURINI Fabio, MALAGUTI Enrico, PARONUZZI Paolo"
"docDescription" => "<span class="document-property-authors">LJUBIC Ivana, FURINI Fabio, MALAGUTI Enrico, PARONUZZI Paolo</span><br><span class="document-property-authors_fields">Systèmes d'Information, Data Analytics et Opérations</span> | <span class="document-property-year">2022</span> <span class="document-property-authors">LJUBIC Ivana, FURINI Fabio, MALAGUTI Enrico, PARONUZZI Paolo "
"keywordList" => "<a href="#">Networks/graphs</a>, <a href="#">Integer programming</a>, <a href="#">Benders decomposition</a>, <a href="#">Cutting plane</a> <a href="#">Networks/graphs</a>, <a href="#">Integer programming</a>, <a href="#">Benders decomposit "
"docPreview" => "<b>Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem</b><br><span>2022-07 | Articles </span> <b>Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator p "
"docType" => "research"
"publicationLink" => "<a href="https://doi.org/10.1287/opre.2021.2110" target="_blank">Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem</a> <a href="https://doi.org/10.1287/opre.2021.2110" target="_blank">Casting light on the hidden bilevel "
]
+lang: "fr"
+"_type": "_doc"
+"_score": 8.784652
+"parent": null
}
