Essec\Faculty\Model\Contribution {#2205
  #_index: "academ_contributions"
  #_id: "14558"
  #_source: array:26 [
    "id" => "14558"
    "slug" => "new-formulations-for-two-location-problems-with-interconnected-facilities"
    "yearMonth" => "2024-04"
    "year" => "2024"
    "title" => "New formulations for two location problems with interconnected facilities"
    "description" => "KUZBAKOV, Y. et LJUBIC, I. (2024). New formulations for two location problems with interconnected facilities. <i>European Journal of Operational Research</i>, 31(1), pp. 51-65."
    "authors" => array:2 [
      0 => array:3 [
        "name" => "LJUBIC Ivana"
        "bid" => "B00683004"
        "slug" => "ljubic-ivana"
      ]
      1 => array:1 [
        "name" => "KUZBAKOV Yerlan"
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:5 [
      0 => "Combinatorial optimization"
      1 => "Discrete location problems"
      2 => "Network design"
      3 => "Branch-and-cut"
      4 => "Benders decomposition"
    ]
    "updatedAt" => "2023-12-18 10:46:31"
    "publicationUrl" => "https://doi.org/10.1016/j.ejor.2023.09.030"
    "publicationInfo" => array:3 [
      "pages" => "51-65"
      "volume" => "31"
      "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" => "This paper studies two location problems with interconnected facilities. In the first problem, all customers need to be served by open facilities, and in the second (covering) variant a penalty is imposed for customers that cannot receive the service. Compared to the standard facility location setting, an additional constraint is imposed asking that all open facilities are interconnected, i.e., all open facilities need to be within a given radius of each other. These problems combine classical facility location aspects with network design, and we exploit this link to derive new mixed integer programming models. The strength of these models is investigated both theoretically and empirically. An extensive computational study is conducted on a set of benchmark instances from the literature, in which branch-and-cut, Benders decomposition and compact models are assessed in terms of the runtime and the resulting gaps."
      "en" => "This paper studies two location problems with interconnected facilities. In the first problem, all customers need to be served by open facilities, and in the second (covering) variant a penalty is imposed for customers that cannot receive the service. Compared to the standard facility location setting, an additional constraint is imposed asking that all open facilities are interconnected, i.e., all open facilities need to be within a given radius of each other. These problems combine classical facility location aspects with network design, and we exploit this link to derive new mixed integer programming models. The strength of these models is investigated both theoretically and empirically. An extensive computational study is conducted on a set of benchmark instances from the literature, in which branch-and-cut, Benders decomposition and compact models are assessed in terms of the runtime and the resulting gaps."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
      "en" => "Information Systems, Decision Sciences and Statistics"
    ]
    "indexedAt" => "2024-05-08T16:21:56.000Z"
    "docTitle" => "New formulations for two location problems with interconnected facilities"
    "docSurtitle" => "Articles"
    "authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, KUZBAKOV Yerlan"
    "docDescription" => "<span class="document-property-authors">LJUBIC Ivana, KUZBAKOV Yerlan</span><br><span class="document-property-authors_fields">Systèmes d’Information, Sciences de la Décision et Statistiques</span> | <span class="document-property-year">2024</span>"
    "keywordList" => "<a href="#">Combinatorial optimization</a>, <a href="#">Discrete location problems</a>, <a href="#">Network design</a>, <a href="#">Branch-and-cut</a>, <a href="#">Benders decomposition</a>"
    "docPreview" => "<b>New formulations for two location problems with interconnected facilities</b><br><span>2024-04 | Articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1016/j.ejor.2023.09.030" target="_blank">New formulations for two location problems with interconnected facilities</a>"
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 8.411744
  +"parent": null
}