Essec\Faculty\Model\Contribution {#2216
  #_index: "academ_contributions"
  #_id: "12954"
  #_source: array:26 [
    "id" => "12954"
    "slug" => "approximation-of-the-double-traveling-salesman-problem-with-multiple-stacks"
    "yearMonth" => "2021-06"
    "year" => "2021"
    "title" => "Approximation of the Double Traveling Salesman Problem with multiple stacks"
    "description" => "ALFANDARI, L. et TOULOUSE, S. (2021). Approximation of the Double Traveling Salesman Problem with multiple stacks. <i>Theoretical Computer Science</i>, 877, pp. 74-89."
    "authors" => array:2 [
      0 => array:3 [
        "name" => "ALFANDARI Laurent"
        "bid" => "B00000901"
        "slug" => "alfandari-laurent"
      ]
      1 => array:1 [
        "name" => "TOULOUSE Sophie"
      ]
    ]
    "ouvrage" => ""
    "keywords" => []
    "updatedAt" => "2022-11-09 16:40:26"
    "publicationUrl" => "https://doi.org/10.1016/j.tcs.2021.05.016"
    "publicationInfo" => array:3 [
      "pages" => "74-89"
      "volume" => "877"
      "number" => ""
    ]
    "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" => """
        Highlights:\n
        We study the approximation of the Double Traveling Salesman Problem with Multiple Stacks.\n
        We study the complexity of two important subproblems.\n
        We provide approximation results for both standard and differential approximation.\n
        Approximation results are derived from reductions to the TSP in the general case.\n
        Algorithms based on optimal matchings and completions are analyzed for the case with two stacks.
        """
      "en" => """
        Highlights:\n
        We study the approximation of the Double Traveling Salesman Problem with Multiple Stacks.\n
        We study the complexity of two important subproblems.\n
        We provide approximation results for both standard and differential approximation.\n
        Approximation results are derived from reductions to the TSP in the general case.\n
        Algorithms based on optimal matchings and completions are analyzed for the case with two stacks.
        """
    ]
    "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 Double Traveling Salesman Problem with multiple stacks"
    "docSurtitle" => "Journal articles"
    "authorNames" => "<a href="/cv/alfandari-laurent">ALFANDARI Laurent</a>, TOULOUSE Sophie"
    "docDescription" => "<span class="document-property-authors">ALFANDARI Laurent, TOULOUSE Sophie</span><br><span class="document-property-authors_fields">Information Systems, Data Analytics and Operations</span> | <span class="document-property-year">2021</span>"
    "keywordList" => ""
    "docPreview" => "<b>Approximation of the Double Traveling Salesman Problem with multiple stacks</b><br><span>2021-06 | Journal articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://doi.org/10.1016/j.tcs.2021.05.016" target="_blank">Approximation of the Double Traveling Salesman Problem with multiple stacks</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 8.099655
  +"parent": null
}