Essec\Faculty\Model\Contribution {#2233
  #_index: "academ_contributions"
  #_id: "6570"
  #_source: array:26 [
    "id" => "6570"
    "slug" => "logical-definability-of-covering-and-partitioning-minimization-problems"
    "yearMonth" => "2000-09"
    "year" => "2000"
    "title" => "Logical Definability of Covering and Partitioning Minimization Problems"
    "description" => "ALFANDARI, L. (2000). Logical Definability of Covering and Partitioning Minimization Problems. Dans: CLAIO X (Congresso Latino-Americano de Investigacion Operativa)-Latin-American Congress of Operations Research, Mexico."
    "authors" => array:1 [
      0 => array:3 [
        "name" => "ALFANDARI Laurent"
        "bid" => "B00000901"
        "slug" => "alfandari-laurent"
      ]
    ]
    "ouvrage" => "CLAIO X (Congresso Latino-Americano de Investigacion Operativa)-Latin-American Congress of Operations Research, Mexico"
    "keywords" => []
    "updatedAt" => "2021-04-19 17:57:25"
    "publicationUrl" => null
    "publicationInfo" => array:3 [
      "pages" => null
      "volume" => null
      "number" => null
    ]
    "type" => array:2 [
      "fr" => "Communications dans une conférence"
      "en" => "Presentations at an Academic or Professional conference"
    ]
    "support_type" => array:2 [
      "fr" => null
      "en" => null
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => "Nous étudions comment la formulation logique de certains problèmes d'optimisation difficiles permet d'évaluer leur niveau d'approximation, en particulier des problèmes de couverture et de partition à coût minimum.  Nous élargissons des résultats de Kolaïtis et Thakur à une classe de problèmes dont nous montrons qu'ils se réduisent au problème de Bi-Set Covering, qui généralise le problème classique de Set Covering. Cette classe contient des problèmes naturels de localisation et de conception de réseau."
      "en" => "We focus on how the logical definability of NP-hard optimization problems can help to decide their approximability. Particularly, we deal with NP-hard minimization covering and partitioning problems. We extend some results of Kolaïtis and Thakur by defining a class containing some natural weighted problems whose approximability is an open problem. We show that all problems in this class amount to a generalization of the classical Set Covering problem, called Bi-Set Covering. Examples of such problems concern optimal location and network design."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d'Information, Data Analytics et Opérations"
      "en" => "Information Systems, Data Analytics and Operations"
    ]
    "indexedAt" => "2024-11-21T08:21:48.000Z"
    "docTitle" => "Logical Definability of Covering and Partitioning Minimization Problems"
    "docSurtitle" => "Communications dans une conférence"
    "authorNames" => "<a href="/cv/alfandari-laurent">ALFANDARI Laurent</a>"
    "docDescription" => "<span class="document-property-authors">ALFANDARI Laurent</span><br><span class="document-property-authors_fields">Systèmes d'Information, Data Analytics et Opérations</span> | <span class="document-property-year">2000</span>"
    "keywordList" => ""
    "docPreview" => "<b>Logical Definability of Covering and Partitioning Minimization Problems</b><br><span>2000-09 | Communications dans une conférence </span>"
    "docType" => "research"
    "publicationLink" => "<a href="#" target="_blank">Logical Definability of Covering and Partitioning Minimization Problems</a>"
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 9.124419
  +"parent": null
}