Essec\Faculty\Model\Contribution {#2233 ▼
#_index: "academ_contributions"
#_id: "15277"
#_source: array:26 [
"id" => "15277"
"slug" => "15277-connected-facility-location-problems"
"yearMonth" => "2023-06"
"year" => "2023"
"title" => "Connected Facility Location Problems"
"description" => "LJUBIC, I. (2023). Connected Facility Location Problems. Dans: Pardalos P.M., Prokopyev O.A. eds. <i>Encyclopedia of Optimization</i>. 3rd ed. Cham: Springer, pp. 1-11. 
LJUBIC, I. (2023). Connected Facility Location Problems. Dans: Pardalos P.M., Prokopyev O.A. eds. <i "
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Encyclopedia of Optimization"
"keywords" => array:5 [
0 => "Connected Facility Location Problem"
1 => "minimum-cost solution"
2 => "Steiner tree"
3 => "methods"
4 => "computational studies"
]
"updatedAt" => "2024-12-17 01:00:56"
"publicationUrl" => "https://doi.org/10.1007/978-3-030-54621-2_870-1"
"publicationInfo" => array:3 [
"pages" => "1-11"
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The (uncapacitated, unrooted) Connected Facility Location Problem (ConFL) is the problem of determining a minimum-cost solution consisting of a set of open facilities used to serve a given set of clients, and to connect the open facilities using a Steiner tree. The cost of a ConFL solution consists of edge costs for building the Steiner tree, the cost for allocating the clients to open facilities, and the cost for opening the facilities. Hence, the ConFL is a generalization of two well-known combinatorial optimization problems: the uncapacitated facility location problem and the Steiner tree problem in graphs. In the past two decades there has been a considerable amount of research devoted to it. The aim of this article is to provide a comprehensive overview of the existing methods, theoretical results, and computational studies for the ConFL and its variants. The (uncapacitated, unrooted) Connected Facility Location Problem (ConFL) is the problem of determin "
"en" => "The (uncapacitated, unrooted) Connected Facility Location Problem (ConFL) is the problem of determining a minimum-cost solution consisting of a set of open facilities used to serve a given set of clients, and to connect the open facilities using a Steiner tree. The cost of a ConFL solution consists of edge costs for building the Steiner tree, the cost for allocating the clients to open facilities, and the cost for opening the facilities. Hence, the ConFL is a generalization of two well-known combinatorial optimization problems: the uncapacitated facility location problem and the Steiner tree problem in graphs. In the past two decades there has been a considerable amount of research devoted to it. The aim of this article is to provide a comprehensive overview of the existing methods, theoretical results, and computational studies for the ConFL and its variants. The (uncapacitated, unrooted) Connected Facility Location Problem (ConFL) is the problem of determin "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-02T13:21:49.000Z"
"docTitle" => "Connected Facility Location Problems"
"docSurtitle" => "Chapitres"
"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">Systèmes d'Information, Data Analytics et Opérations</span> | <span class="document-property-year">2023</span> <span class="document-property-authors">LJUBIC Ivana</span><br><span class="document-property-author "
"keywordList" => "<a href="#">Connected Facility Location Problem</a>, <a href="#">minimum-cost solution</a>, <a href="#">Steiner tree</a>, <a href="#">methods</a>, <a href="#">computational studies</a> <a href="#">Connected Facility Location Problem</a>, <a href="#">minimum-cost solution</a>, <a href= "
"docPreview" => "<b>Connected Facility Location Problems</b><br><span>2023-06 | Chapitres </span>"
"docType" => "research"
"publicationLink" => "<a href="https://doi.org/10.1007/978-3-030-54621-2_870-1" target="_blank">Connected Facility Location Problems</a> <a href="https://doi.org/10.1007/978-3-030-54621-2_870-1" target="_blank">Connected Facility Locatio "
]
+lang: "fr"
+"_type": "_doc"
+"_score": 8.742511
+"parent": null
}
