Essec\Faculty\Model\Contribution {#2216
#_index: "academ_contributions"
#_id: "13116"
#_source: array:26 [
"id" => "13116"
"slug" => "general-cut-generating-procedures-for-the-stable-set-polytope"
"yearMonth" => "2018-08"
"year" => "2018"
"title" => "General cut-generating procedures for the stable set polytope"
"description" => "CORRÊA, R., DELLE DONNE, D., KOCH, I. et MARENCO, J. (2018). General cut-generating procedures for the stable set polytope. <i>Discrete Applied Mathematics</i>, 245(1), pp. 28-41."
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:1 [
"name" => "CORRÊA Ricardo"
]
2 => array:1 [
"name" => "KOCH Ivo"
]
3 => array:1 [
"name" => "MARENCO Javier"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Integer programming"
1 => "Polyhedral"
2 => "Facet defining generation"
3 => "Stable sets"
]
"updatedAt" => "2023-01-27 01:00:44"
"publicationUrl" => "https://doi.org/10.1016/j.dam.2017.02.005"
"publicationInfo" => array:3 [
"pages" => "28-41"
"volume" => "245"
"number" => "1"
]
"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" => "We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and Campêlo. In contrast to existing cut-generating procedures, ours generate both rank and non-rank valid inequalities, hence they are of a more general nature than existing methods. This is accomplished by iteratively solving a lifting problem, which consists of a maximum weighted stable set problem on a smaller graph. Computational experience on DIMACS benchmark instances shows that the proposed approach may be a useful tool for generating cuts for the stable set polytope."
"en" => "We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and Campêlo. In contrast to existing cut-generating procedures, ours generate both rank and non-rank valid inequalities, hence they are of a more general nature than existing methods. This is accomplished by iteratively solving a lifting problem, which consists of a maximum weighted stable set problem on a smaller graph. Computational experience on DIMACS benchmark instances shows that the proposed approach may be a useful tool for generating cuts for the stable set polytope."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2024-12-22T03:21:45.000Z"
"docTitle" => "General cut-generating procedures for the stable set polytope"
"docSurtitle" => "Journal articles"
"authorNames" => "<a href="/cv/delle-donne-diego">DELLE DONNE Diego</a>, CORRÊA Ricardo, KOCH Ivo, MARENCO Javier"
"docDescription" => "<span class="document-property-authors">DELLE DONNE Diego, CORRÊA Ricardo, KOCH Ivo, MARENCO Javier</span><br><span class="document-property-authors_fields">Information Systems, Data Analytics and Operations</span> | <span class="document-property-year">2018</span>"
"keywordList" => "<a href="#">Integer programming</a>, <a href="#">Polyhedral</a>, <a href="#">Facet defining generation</a>, <a href="#">Stable sets</a>"
"docPreview" => "<b>General cut-generating procedures for the stable set polytope</b><br><span>2018-08 | Journal articles </span>"
"docType" => "research"
"publicationLink" => "<a href="https://doi.org/10.1016/j.dam.2017.02.005" target="_blank">General cut-generating procedures for the stable set polytope</a>"
]
+lang: "en"
+"_type": "_doc"
+"_score": 8.743467
+"parent": null
}
