0 of 0       
Essec\Faculty\Model\Contribution {#2233 ▼
  #_index: "academ_contributions"
  #_id: "14247"
  #_source: array:26 [
    "id" => "14247"
    "slug" => "14247-exact-methods-for-discrete-%ce%b3-robust-interdiction-problems-with-an-application-to-the-bilevel-knapsack-problem 14247-exact-methods-for-discrete-%ce%b3-robust-interdiction-problems-with-an-application-to-the-bile "
    "yearMonth" => "2023-12"
    "year" => "2023"
    "title" => "Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsack problem Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsac "
    "description" => "BECK, Y., LJUBIC, I. et SCHMIDT, M. (2023). Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsack problem. <i>Mathematical Programming Computation</i>, 15(4), pp. 733-782. BECK, Y., LJUBIC, I. et SCHMIDT, M. (2023). Exact methods for discrete Γ-robust interdiction problem "
    "authors" => array:3 [
      0 => array:3 [
        "name" => "LJUBIC Ivana"
        "bid" => "B00683004"
        "slug" => "ljubic-ivana"
      ]
      1 => array:1 [
        "name" => "BECK Yasmine"
      ]
      2 => array:1 [
        "name" => "SCHMIDT Martin"
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:4 [
      0 => "Bilevel optimization – Robust optimization"
      1 => "Knapsack interdiction"
      2 => "Mixed-integer programming"
      3 => "Branch-and-Cut"
    ]
    "updatedAt" => "2024-10-31 13:51:19"
    "publicationUrl" => "https://doi.org/10.1007/s12532-023-00244-6"
    "publicationInfo" => array:3 [
      "pages" => "733-782"
      "volume" => "15"
      "number" => "4"
    ]
    "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" => "Developing solution methods for discrete bilevel problems is known to be a challenging task—even if all parameters of the problem are exactly known. Many real-world applications of bilevel optimization, however, involve data uncertainty. We study discrete min-max problems with a follower who faces uncertainties regarding the parameters of the lower-level problem. Adopting a Γ-robust approach, we present an extended formulation and a multi-follower formulation to model this type of problem. For both settings, we provide a generic branch-and-cut framework. Specifically, we investigate interdiction problems with a monotone Γ-robust follower and we derive problem-tailored cuts, which extend existing techniques that have been proposed for the deterministic case. For the Γ-robust knapsack interdiction problem, we computationally evaluate and compare the performance of the proposed algorithms for both modeling approaches. Developing solution methods for discrete bilevel problems is known to be a challenging task—even if  "
      "en" => "Developing solution methods for discrete bilevel problems is known to be a challenging task—even if all parameters of the problem are exactly known. Many real-world applications of bilevel optimization, however, involve data uncertainty. We study discrete min-max problems with a follower who faces uncertainties regarding the parameters of the lower-level problem. Adopting a Γ-robust approach, we present an extended formulation and a multi-follower formulation to model this type of problem. For both settings, we provide a generic branch-and-cut framework. Specifically, we investigate interdiction problems with a monotone Γ-robust follower and we derive problem-tailored cuts, which extend existing techniques that have been proposed for the deterministic case. For the Γ-robust knapsack interdiction problem, we computationally evaluate and compare the performance of the proposed algorithms for both modeling approaches. Developing solution methods for discrete bilevel problems is known to be a challenging task—even if  "
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d'Information, Data Analytics et Opérations"
      "en" => "Information Systems, Data Analytics and Operations"
    ]
    "indexedAt" => "2025-04-02T14:21:41.000Z"
    "docTitle" => "Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsack problem Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsac "
    "docSurtitle" => "Articles"
    "authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, BECK Yasmine, SCHMIDT Martin"
    "docDescription" => "<span class="document-property-authors">LJUBIC Ivana, BECK Yasmine, SCHMIDT Martin</span><br><span class="document-property-authors_fields">Systèmes d'Information, Data Analytics et Opérations</span> | <span class="document-property-year">2023</span> <span class="document-property-authors">LJUBIC Ivana, BECK Yasmine, SCHMIDT Martin</span><br><span c "
    "keywordList" => "<a href="#">Bilevel optimization – Robust optimization</a>, <a href="#">Knapsack interdiction</a>, <a href="#">Mixed-integer programming</a>, <a href="#">Branch-and-Cut</a> <a href="#">Bilevel optimization – Robust optimization</a>, <a href="#">Knapsack interdiction</a>, < "
    "docPreview" => "<b>Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsack problem</b><br><span>2023-12 | Articles </span> <b>Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knap "
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1007/s12532-023-00244-6" target="_blank">Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsack problem</a> <a href="https://doi.org/10.1007/s12532-023-00244-6" target="_blank">Exact methods for discrete Γ-ro "
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 8.5577965
  +"parent": null
}