Essec\Faculty\Model\Contribution {#2233
  #_index: "academ_contributions"
  #_id: "10485"
  #_source: array:26 [
    "id" => "10485"
    "slug" => "a-note-on-the-bertsimas-sim-algorithm-for-robust-combinatorial-optimization-problems"
    "yearMonth" => "2013-12"
    "year" => "2013"
    "title" => "A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems"
    "description" => "ALVAREZ-MIRANDA, E., LJUBIC, I. et TOTH, P. (2013). A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. <i>4OR: A Quarterly Journal of Operations Research</i>, 11(4), pp. 349-360."
    "authors" => array:3 [
      0 => array:3 [
        "name" => "LJUBIC Ivana"
        "bid" => "B00683004"
        "slug" => "ljubic-ivana"
      ]
      1 => array:1 [
        "name" => "ALVAREZ-MIRANDA Eduardo"
      ]
      2 => array:1 [
        "name" => "TOTH Peter"
      ]
    ]
    "ouvrage" => ""
    "keywords" => []
    "updatedAt" => "2021-07-13 14:31:36"
    "publicationUrl" => "https://doi.org/10.1007/s10288-013-0231-6"
    "publicationInfo" => array:3 [
      "pages" => "349-360"
      "volume" => "11"
      "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" => "We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49–71, 2003) regarding the computation of optimal solutions of Robust Combinatorial Optimization problems with interval uncertainty in the objective function coefficients. We also extend this improvement to a more general class of Combinatorial Optimization problems with interval uncertainty."
      "en" => "We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49–71, 2003) regarding the computation of optimal solutions of Robust Combinatorial Optimization problems with interval uncertainty in the objective function coefficients. We also extend this improvement to a more general class of Combinatorial Optimization problems with interval uncertainty."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d'Information, Data Analytics et Opérations"
      "en" => "Information Systems, Data Analytics and Operations"
    ]
    "indexedAt" => "2024-11-21T13:21:44.000Z"
    "docTitle" => "A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems"
    "docSurtitle" => "Articles"
    "authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, ALVAREZ-MIRANDA Eduardo, TOTH Peter"
    "docDescription" => "<span class="document-property-authors">LJUBIC Ivana, ALVAREZ-MIRANDA Eduardo, TOTH Peter</span><br><span class="document-property-authors_fields">Systèmes d'Information, Data Analytics et Opérations</span> | <span class="document-property-year">2013</span>"
    "keywordList" => ""
    "docPreview" => "<b>A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems</b><br><span>2013-12 | Articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1007/s10288-013-0231-6" target="_blank">A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems</a>"
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 8.760923
  +"parent": null
}