Essec\Faculty\Model\Contribution {#2216
#_index: "academ_contributions"
#_id: "12095"
#_source: array:26 [
"id" => "12095"
"slug" => "solving-steiner-trees-recent-advances-challenges-and-perspectives"
"yearMonth" => "2021-03"
"year" => "2021"
"title" => "Solving Steiner trees: Recent advances, challenges, and perspectives"
"description" => "LJUBIC, I. (2021). Solving Steiner trees: Recent advances, challenges, and perspectives. <i>Networks</i>, 77(2), pp. 177-204."
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "combinatorial optimization, exact methods, heuristics, integer programming, Steiner tree problem"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1002/net.22005"
"publicationInfo" => array:3 [
"pages" => "177-204"
"volume" => "77"
"number" => "2"
]
"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" => "The Steiner tree problem (STP) in graphs is one of the most studied problems in combinatorial optimization. Since its inception in 1970, numerous articles published in the journal Networks have stimulated new theoretical and computational studies on Steiner trees: from approximation algorithms, heuristics, metaheuristics, all the way to exact algorithms based on (mixed) integer linear programming, fixed parameter tractability, or combinatorial branch‐and‐bounds. The pervasive applicability and relevance of Steiner trees have been reinforced by the recent 11th DIMACS Implementation Challenge in 2014 and the PACE 2018 Challenge. This article provides an overview of the rich developments from the last three decades for the STP in graphs and highlights the most recent computational studies for some of its closely related variants."
"en" => "The Steiner tree problem (STP) in graphs is one of the most studied problems in combinatorial optimization. Since its inception in 1970, numerous articles published in the journal Networks have stimulated new theoretical and computational studies on Steiner trees: from approximation algorithms, heuristics, metaheuristics, all the way to exact algorithms based on (mixed) integer linear programming, fixed parameter tractability, or combinatorial branch‐and‐bounds. The pervasive applicability and relevance of Steiner trees have been reinforced by the recent 11th DIMACS Implementation Challenge in 2014 and the PACE 2018 Challenge. This article provides an overview of the rich developments from the last three decades for the STP in graphs and highlights the most recent computational studies for some of its closely related variants."
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2024-11-23T07:21:43.000Z"
"docTitle" => "Solving Steiner trees: Recent advances, challenges, and perspectives"
"docSurtitle" => "Journal articles"
"authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>"
"docDescription" => "<span class="document-property-authors">LJUBIC Ivana</span><br><span class="document-property-authors_fields">Information Systems, Data Analytics and Operations</span> | <span class="document-property-year">2021</span>"
"keywordList" => "<a href="#">combinatorial optimization, exact methods, heuristics, integer programming, Steiner tree problem</a>"
"docPreview" => "<b>Solving Steiner trees: Recent advances, challenges, and perspectives</b><br><span>2021-03 | Journal articles </span>"
"docType" => "research"
"publicationLink" => "<a href="https://doi.org/10.1002/net.22005" target="_blank">Solving Steiner trees: Recent advances, challenges, and perspectives</a>"
]
+lang: "en"
+"_type": "_doc"
+"_score": 8.5796795
+"parent": null
}
