Essec\Faculty\Model\Contribution {#2216
  #_index: "academ_contributions"
  #_id: "2662"
  #_source: array:26 [
    "id" => "2662"
    "slug" => "the-greedy-approach-for-the-crew-pairing-problem-some-cases-of-polynomial-subproblems"
    "yearMonth" => "1999-01"
    "year" => "1999"
    "title" => "The Greedy Approach for the Crew Pairing Problem: Some Cases of Polynomial Subproblems"
    "description" => "ALFANDARI, L. (1999). The Greedy Approach for the Crew Pairing Problem: Some Cases of Polynomial Subproblems. <i>Cahiers du Lamsade (Laboratoire d'Analyse et de Modélisation de Systèmes d'Aide)</i>, pp. 1-10."
    "authors" => array:1 [
      0 => array:3 [
        "name" => "ALFANDARI Laurent"
        "bid" => "B00000901"
        "slug" => "alfandari-laurent"
      ]
    ]
    "ouvrage" => ""
    "keywords" => []
    "updatedAt" => "2021-07-13 14:30:59"
    "publicationUrl" => null
    "publicationInfo" => array:3 [
      "pages" => "1-10"
      "volume" => null
      "number" => null
    ]
    "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" => "Le problème de Crew Pairing dans le transport aérien consiste à construire des rotations d'équipages (pilotes et personnel de cabine) couvrant l'ensemble des vols de la compagnie et minimisant, par exemple, la somme globale des temps de pause entre deux vols. Ce problème d'optimisation sous contraintes peut se modéliser comme un programme linéaire en nombres entiers de très grande taille, et se résoud classiquement par des techniques dites de "génération de colonnes ". Nous formalisons quelques cas pour lesquels le sous-problème associé à l'approche gloutonne est soluble en temps polynomial."
      "en" => "The Crew Pairing Problem in air transportation consists in assigning pilots, stewarts and hostesses to sequences of flights so that every flight of the company is covered by a crew, and the total sum of rest periods is minimized.This optimization problem can be modelled as a very large-scale integer 0-1 linear program. It can be solved by specialized techniques for set covering problems, called "column generation". We define some classes of problems where the sub-problem associated with the greedy approach is solvable in polynomial time."
    ]
    "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" => "The Greedy Approach for the Crew Pairing Problem: Some Cases of Polynomial Subproblems"
    "docSurtitle" => "Journal articles"
    "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">Information Systems, Data Analytics and Operations</span> | <span class="document-property-year">1999</span>"
    "keywordList" => ""
    "docPreview" => "<b>The Greedy Approach for the Crew Pairing Problem: Some Cases of Polynomial Subproblems</b><br><span>1999-01 | Journal articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="#" target="_blank">The Greedy Approach for the Crew Pairing Problem: Some Cases of Polynomial Subproblems</a>"
  ]
  +lang: "en"
  +"_type": "_doc"
  +"_score": 9.2693
  +"parent": null
}