Essec\Faculty\Model\Contribution {#2216
  #_index: "academ_contributions"
  #_id: "4386"
  #_source: array:26 [
    "id" => "4386"
    "slug" => "approximation-of-the-clustered-set-covering-problem"
    "yearMonth" => "2010-03"
    "year" => "2010"
    "title" => "Approximation of the Clustered Set Covering Problem"
    "description" => "ALFANDARI, L. et MONNOT, J. (2010). Approximation of the Clustered Set Covering Problem. Dans: <i>Electronic Notes in Discrete Mathematics</i>. ISCO."
    "authors" => array:2 [
      0 => array:3 [
        "name" => "ALFANDARI Laurent"
        "bid" => "B00000901"
        "slug" => "alfandari-laurent"
      ]
      1 => array:1 [
        "name" => "MONNOT J."
      ]
    ]
    "ouvrage" => "Electronic Notes in Discrete Mathematics"
    "keywords" => []
    "updatedAt" => "2021-04-19 17:57:25"
    "publicationUrl" => null
    "publicationInfo" => array:3 [
      "pages" => null
      "volume" => null
      "number" => null
    ]
    "type" => array:2 [
      "fr" => "Actes d'une conférence"
      "en" => "Conference Proceedings"
    ]
    "support_type" => array:2 [
      "fr" => "Editeur"
      "en" => "Publisher"
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => "We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. This variant can reformulate as a master problem various multi-commodity flow problems in transportation planning."
      "en" => "We define a NP-hard clustered variant of the Set Covering Problem where subsets are partitioned into K clusters and a fixed cost is paid for selecting at least one subset in a given cluster. This variant can reformulate as a master problem various multi-commodity flow problems in transportation planning."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d'Information, Data Analytics et Opérations"
      "en" => "Information Systems, Data Analytics and Operations"
    ]
    "indexedAt" => "2024-12-03T16:21:42.000Z"
    "docTitle" => "Approximation of the Clustered Set Covering Problem"
    "docSurtitle" => "Conference Proceedings"
    "authorNames" => "<a href="/cv/alfandari-laurent">ALFANDARI Laurent</a>, MONNOT J."
    "docDescription" => "<span class="document-property-authors">ALFANDARI Laurent, MONNOT J.</span><br><span class="document-property-authors_fields">Information Systems, Data Analytics and Operations</span> | <span class="document-property-year">2010</span>"
    "keywordList" => ""
    "docPreview" => "<b>Approximation of the Clustered Set Covering Problem</b><br><span>2010-03 | Conference Proceedings </span>"
    "docType" => "research"
    "publicationLink" => "<a href="#" target="_blank">Approximation of the Clustered Set Covering Problem</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 9.2693
  +"parent": null
}