Essec\Faculty\Model\Contribution {#2233
  #_index: "academ_contributions"
  #_id: "13117"
  #_source: array:26 [
    "id" => "13117"
    "slug" => "the-maximum-impact-coloring-polytope"
    "yearMonth" => "2017-03"
    "year" => "2017"
    "title" => "The maximum-impact coloring polytope"
    "description" => "BRAGA, M., DELLE DONNE, D., LINFATI, R. et MARENCO, J. (2017). The maximum-impact coloring polytope. <i>International Transactions in Operational Research</i>, 24(1-2), pp. 303-324."
    "authors" => array:4 [
      0 => array:3 [
        "name" => "DELLE DONNE Diego"
        "bid" => "B00788133"
        "slug" => "delle-donne-diego"
      ]
      1 => array:1 [
        "name" => "BRAGA Mónica"
      ]
      2 => array:1 [
        "name" => "LINFATI Rodrigo"
      ]
      3 => array:1 [
        "name" => "MARENCO Javier"
      ]
    ]
    "ouvrage" => ""
    "keywords" => []
    "updatedAt" => "2023-01-27 01:00:44"
    "publicationUrl" => "https://doi.org/10.1111/itor.12265"
    "publicationInfo" => array:3 [
      "pages" => "303-324"
      "volume" => "24"
      "number" => "1-2"
    ]
    "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" => "In this setting, the “maximum-impact coloring” problem asks for a proper coloring of G maximizing the impact urn:x-wiley:09696016:media:itor12265:itor12265-math-0007 on H. This problem naturally arises in the assignment of classrooms to courses, where it is desirable—but not mandatory—to assign lectures from the same course to the same classroom. Since the maximum-impact coloring problem is NP-hard, we propose in this work an integer programming based approach for tackling this problem. To this end, we present an integer programming formulation and study the associated polytope. We provide several families of valid inequalities, and we study under which conditions these inequalities define facets of the associated polytope. Finally, we show computational evidence over real-life instances suggesting that some of these families may be useful in a cutting-plane environment."
      "en" => "In this setting, the “maximum-impact coloring” problem asks for a proper coloring of G maximizing the impact urn:x-wiley:09696016:media:itor12265:itor12265-math-0007 on H. This problem naturally arises in the assignment of classrooms to courses, where it is desirable—but not mandatory—to assign lectures from the same course to the same classroom. Since the maximum-impact coloring problem is NP-hard, we propose in this work an integer programming based approach for tackling this problem. To this end, we present an integer programming formulation and study the associated polytope. We provide several families of valid inequalities, and we study under which conditions these inequalities define facets of the associated polytope. Finally, we show computational evidence over real-life instances suggesting that some of these families may be useful in a cutting-plane environment."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d'Information, Data Analytics et Opérations"
      "en" => "Information Systems, Data Analytics and Operations"
    ]
    "indexedAt" => "2024-11-21T11:21:49.000Z"
    "docTitle" => "The maximum-impact coloring polytope"
    "docSurtitle" => "Articles"
    "authorNames" => "<a href="/cv/delle-donne-diego">DELLE DONNE Diego</a>, BRAGA Mónica, LINFATI Rodrigo, MARENCO Javier"
    "docDescription" => "<span class="document-property-authors">DELLE DONNE Diego, BRAGA Mónica, LINFATI Rodrigo, MARENCO Javier</span><br><span class="document-property-authors_fields">Systèmes d'Information, Data Analytics et Opérations</span> | <span class="document-property-year">2017</span>"
    "keywordList" => ""
    "docPreview" => "<b>The maximum-impact coloring polytope</b><br><span>2017-03 | Articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1111/itor.12265" target="_blank">The maximum-impact coloring polytope</a>"
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 8.953466
  +"parent": null
}