Essec\Faculty\Model\Contribution {#2233
  #_index: "academ_contributions"
  #_id: "11999"
  #_source: array:26 [
    "id" => "11999"
    "slug" => "a-new-branch-and-bound-algorithm-for-the-maximum-edge-weighted-clique-problem"
    "yearMonth" => "2019-10"
    "year" => "2019"
    "title" => "A new branch-and-bound algorithm for the maximum edge-weighted clique problem"
    "description" => "SAN SEGUNDO, P., CONIGLIO, S., FURINI, F. et LJUBIC, I. (2019). A new branch-and-bound algorithm for the maximum edge-weighted clique problem. <i>European Journal of Operational Research</i>, 278(1), pp. 76-90."
    "authors" => array:4 [
      0 => array:3 [
        "name" => "LJUBIC Ivana"
        "bid" => "B00683004"
        "slug" => "ljubic-ivana"
      ]
      1 => array:1 [
        "name" => "SAN SEGUNDO Pablo"
      ]
      2 => array:1 [
        "name" => "CONIGLIO Stefano"
      ]
      3 => array:1 [
        "name" => "FURINI Fabio"
      ]
    ]
    "ouvrage" => ""
    "keywords" => array:1 [
      0 => "Combinatorial optimization, Branch-and-bound, Maximum edge-weighted clique problem"
    ]
    "updatedAt" => "2021-09-24 10:33:27"
    "publicationUrl" => "https://www.sciencedirect.com/science/article/pii/S0377221719303054"
    "publicationInfo" => array:3 [
      "pages" => "76-90"
      "volume" => "278"
      "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" => "We study the maximum edge-weighted clique problem, a problem related to the maximum (vertex-weighted) clique problem which asks for finding a complete subgraph (i.e., a clique) of maximum total weight on its edges. The problem appears in a wide range of applications, including bioinformatics, material science, computer vision, robotics, and many more. In this work, we propose a new combinatorial branch-and-bound algorithm for the problem which relies on a novel bounding procedure capable of pruning a very large amount of nodes of the branch-and-bound tree. Extensive computational experiments on random and structured graphs, encompassing standard benchmarks used in the literature as well as recently introduced real-world large-scale graphs, show that our new algorithm outperforms the state-of-the-art by several orders of magnitude on many instances."
      "en" => "We study the maximum edge-weighted clique problem, a problem related to the maximum (vertex-weighted) clique problem which asks for finding a complete subgraph (i.e., a clique) of maximum total weight on its edges. The problem appears in a wide range of applications, including bioinformatics, material science, computer vision, robotics, and many more. In this work, we propose a new combinatorial branch-and-bound algorithm for the problem which relies on a novel bounding procedure capable of pruning a very large amount of nodes of the branch-and-bound tree. Extensive computational experiments on random and structured graphs, encompassing standard benchmarks used in the literature as well as recently introduced real-world large-scale graphs, show that our new algorithm outperforms the state-of-the-art by several orders of magnitude on many instances."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d'Information, Data Analytics et Opérations"
      "en" => "Information Systems, Data Analytics and Operations"
    ]
    "indexedAt" => "2024-12-22T03:21:45.000Z"
    "docTitle" => "A new branch-and-bound algorithm for the maximum edge-weighted clique problem"
    "docSurtitle" => "Articles"
    "authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, SAN SEGUNDO Pablo, CONIGLIO Stefano, FURINI Fabio"
    "docDescription" => "<span class="document-property-authors">LJUBIC Ivana, SAN SEGUNDO Pablo, CONIGLIO Stefano, FURINI Fabio</span><br><span class="document-property-authors_fields">Systèmes d'Information, Data Analytics et Opérations</span> | <span class="document-property-year">2019</span>"
    "keywordList" => "<a href="#">Combinatorial optimization, Branch-and-bound, Maximum edge-weighted clique problem</a>"
    "docPreview" => "<b>A new branch-and-bound algorithm for the maximum edge-weighted clique problem</b><br><span>2019-10 | Articles </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://www.sciencedirect.com/science/article/pii/S0377221719303054" target="_blank">A new branch-and-bound algorithm for the maximum edge-weighted clique problem</a>"
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 8.743467
  +"parent": null
}