Essec\Faculty\Model\Contribution {#2233 ▼
#_index: "academ_contributions"
#_id: "2182"
#_source: array:26 [
"id" => "2182"
"slug" => "2182-outer-approximation-and-submodular-cuts-for-maximum-capture-facility-location-problems-with-random-utilities 
2182-outer-approximation-and-submodular-cuts-for-maximum-capture-facility-location-problems-with-ran "
"yearMonth" => "2018-04"
"year" => "2018"
"title" => "Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random U "
"description" => "LJUBIC, I. et MORENO, E. (2018). Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities. <i>European Journal of Operational Research</i>, 266(1), pp. 46-56. LJUBIC, I. et MORENO, E. (2018). Outer Approximation and Submodular Cuts for Maximum Capture Facilit "
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "MORENO E."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial optimization"
1 => "Branch-and-cut"
2 => "Maximum capture"
3 => "Random utility model"
4 => "Competitive facility location"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0377221717308445"
"publicationInfo" => array:3 [
"pages" => "46-56"
"volume" => "266"
"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 consider a family of competitive facility location problems in which a “newcomer” company enters the market and has to decide where to locate a set of new facilities so as to maximize its market share. The multinomial logit model is used to estimate the captured customer demand. We propose a first branch-and-cut approach for this family of difficult mixed-integer non-linear problems. Our approach combines two types of cutting planes that exploit particular properties of the objective function: the first one are the outer-approximation cuts and the second one are the submodular cuts.The approach is computationally evaluated on three datasets from the recent literature. The obtained results show that our new branch-and-cut drastically outperforms state-of-the-art exact approaches, both in terms of the computing times, and in terms of the number of instances solved to optimality. We consider a family of competitive facility location problems in which a “newcomer” company enters "
"en" => "We consider a family of competitive facility location problems in which a “newcomer” company enters the market and has to decide where to locate a set of new facilities so as to maximize its market share. The multinomial logit model is used to estimate the captured customer demand. We propose a first branch-and-cut approach for this family of difficult mixed-integer non-linear problems. Our approach combines two types of cutting planes that exploit particular properties of the objective function: the first one are the outer-approximation cuts and the second one are the submodular cuts.The approach is computationally evaluated on three datasets from the recent literature. The obtained results show that our new branch-and-cut drastically outperforms state-of-the-art exact approaches, both in terms of the computing times, and in terms of the number of instances solved to optimality. We consider a family of competitive facility location problems in which a “newcomer” company enters "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-02T09:21:48.000Z"
"docTitle" => "Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random U "
"docSurtitle" => "Articles"
"authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, MORENO E."
"docDescription" => "<span class="document-property-authors">LJUBIC Ivana, MORENO E.</span><br><span class="document-property-authors_fields">Systèmes d'Information, Data Analytics et Opérations</span> | <span class="document-property-year">2018</span> <span class="document-property-authors">LJUBIC Ivana, MORENO E.</span><br><span class="document-prop "
"keywordList" => "<a href="#">Combinatorial optimization</a>, <a href="#">Branch-and-cut</a>, <a href="#">Maximum capture</a>, <a href="#">Random utility model</a>, <a href="#">Competitive facility location</a> <a href="#">Combinatorial optimization</a>, <a href="#">Branch-and-cut</a>, <a href="#">Maximum capt "
"docPreview" => "<b>Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities</b><br><span>2018-04 | Articles </span> <b>Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Rando "
"docType" => "research"
"publicationLink" => "<a href="https://www.sciencedirect.com/science/article/abs/pii/S0377221717308445" target="_blank">Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities</a> <a href="https://www.sciencedirect.com/science/article/abs/pii/S0377221717308445" target="_blank">Ou "
]
+lang: "fr"
+"_type": "_doc"
+"_score": 9.300973
+"parent": null
}
