Essec\Faculty\Model\Contribution {#2190`
#_index: "academ_contributions"
#_id: "13274"
#_source: array:25 [``
"id" => "13274"
"slug" => "submodular-maximization-of-concave-utility-functions-composed-with-a-set-union-operator-with-applications-to-maximal-covering-location-problems"
"yearMonth" => "2022-11"
"year" => "2022"
"title" => "Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems"
"description" => "CONIGLIO, S., FURINI, F. et LJUBIC, I. (2022). Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. <i>Mathematical Programming</i>, 196(1-2), pp. 9-56."
"authors" => array:3 [``
0 => array:3 [``
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
`]
1 => array:1 [`
"name" => "CONIGLIO Stefano"
`]
2 => array:1 [`
"name" => "FURINI Fabio"
`]
]
"ouvrage" => ""
"keywords" => array:5 [`
0 => "Submodular maximization"
1 => "Branch-and-Cut"
2 => "Benders decomposition"
3 => "Stochastic maximal covering location problems"
4 => "Influence maximization"
`]
"updatedAt" => "2023-04-28 09:13:50"
"publicationUrl" => "https://doi.org/10.1007/s10107-022-01884-7"
"publicationInfo" => array:3 [`
"pages" => "9-56"
"volume" => "196"
"number" => "1-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" => "We study a family of discrete optimization problems asking for the maximization of the expected value of a concave, strictly increasing, and differentiable function composed with a set-union operator. The expected value is computed with respect to a set of coefficients taking values from a discrete set of scenarios. The function models the utility function of the decision maker, while the set-union operator models a covering relationship between two ground sets, a set of items and a set of metaitems. This problem generalizes the problem introduced by Ahmed S, Atamtürk A (Mathematical programming 128(1-2):149–169, 2011), and it can be modeled as a mixed integer nonlinear program involving binary decision variables associated with the items and metaitems. Its goal is to find a subset of metaitems that maximizes the total utility corresponding to the items it covers."
"en" => "We study a family of discrete optimization problems asking for the maximization of the expected value of a concave, strictly increasing, and differentiable function composed with a set-union operator. The expected value is computed with respect to a set of coefficients taking values from a discrete set of scenarios. The function models the utility function of the decision maker, while the set-union operator models a covering relationship between two ground sets, a set of items and a set of metaitems. This problem generalizes the problem introduced by Ahmed S, Atamtürk A (Mathematical programming 128(1-2):149–169, 2011), and it can be modeled as a mixed integer nonlinear program involving binary decision variables associated with the items and metaitems. Its goal is to find a subset of metaitems that maximizes the total utility corresponding to the items it covers."
`]
"authors_fields" => array:2 [`
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
`]
"indexedAt" => "2023-12-11T14:22:11.000Z"
"docTitle" => "Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems"
"docSurtitle" => "Journal articles"
"authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, CONIGLIO Stefano, FURINI Fabio"
"docDescription" => "<span class="document-property-authors">LJUBIC Ivana, CONIGLIO Stefano, FURINI Fabio</span><br><span class="document-property-authors_fields">Information Systems, Decision Sciences and Statistics</span> | <span class="document-property-year">2022</span>"
"keywordList" => "<a href="#">Submodular maximization</a>, <a href="#">Branch-and-Cut</a>, <a href="#">Benders decomposition</a>, <a href="#">Stochastic maximal covering location problems</a>, <a href="#">Influence maximization</a>"
"docPreview" => "<b>Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems</b><br><span>2022-11 | Journal articles </span>"
"docType" => "research"
]
+lang: "en"
+"_type": "_doc"
+"_score": 8.715715
+"parent": null
}