Essec\Faculty\Model\Contribution {#2216 ▼
#_index: "academ_contributions"
#_id: "568"
#_source: array:26 [
"id" => "568"
"slug" => "568-a-note-on-the-clustered-set-covering-problem"
"yearMonth" => "2014-02"
"year" => "2014"
"title" => "A Note on the Clustered Set Covering Problem"
"description" => "ALFANDARI, L. et MONNOT, J. (2014). A Note on the Clustered Set Covering Problem. <i>Discrete Applied Mathematics</i>, 1(164), pp. 13-19. 
ALFANDARI, L. et MONNOT, J. (2014). A Note on the Clustered Set Covering Problem. <i>Discrete Applie "
"authors" => array:2 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:1 [
"name" => "MONNOT J."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Integer programming"
1 => "Set covering"
2 => "Maximal coverage"
3 => "Approximation"
]
"updatedAt" => "2021-02-02 16:16:18"
"publicationUrl" => "https://www.sciencedirect.com/science/article/pii/S0166218X11004847"
"publicationInfo" => array:3 [
"pages" => "13-19"
"volume" => "1"
"number" => "164"
]
"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" => "Nous proposons une heuristique d'approximation pour une généralisation du problème classique de Set Covering avec partition des sous-ensembles en clusters induisant le paiement d'un coût fixe dès qu'un cluster est utilisé. Nous proposons une heuristique d'approximation pour une généralisation du problème classique de Set "
"en" => "We propose an approximation heuristic for a NP-hard clustered variant of the Set Covering Problem where subsets are partitionned into K clusters and a fixed cost is paid for selecting at least one subset in a cluster. We propose an approximation heuristic for a NP-hard clustered variant of the Set Covering Problem wh "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-05T23:21:40.000Z"
"docTitle" => "A Note on the Clustered Set Covering Problem"
"docSurtitle" => "Journal articles"
"authorNames" => "<a href="/cv/alfandari-laurent">ALFANDARI Laurent</a>, MONNOT J."
"docDescription" => "<span class="document-property-authors">ALFANDARI Laurent, MONNOT J.</span><br><span class="document-property-authors_fields">Information Systems, Data Analytics and Operations</span> | <span class="document-property-year">2014</span> <span class="document-property-authors">ALFANDARI Laurent, MONNOT J.</span><br><span class="document "
"keywordList" => "<a href="#">Integer programming</a>, <a href="#">Set covering</a>, <a href="#">Maximal coverage</a>, <a href="#">Approximation</a> <a href="#">Integer programming</a>, <a href="#">Set covering</a>, <a href="#">Maximal coverage</a>, "
"docPreview" => "<b>A Note on the Clustered Set Covering Problem</b><br><span>2014-02 | Journal articles </span>"
"docType" => "research"
"publicationLink" => "<a href="https://www.sciencedirect.com/science/article/pii/S0166218X11004847" target="_blank">A Note on the Clustered Set Covering Problem</a> <a href="https://www.sciencedirect.com/science/article/pii/S0166218X11004847" target="_blank">A Note "
]
+lang: "en"
+"_type": "_doc"
+"_score": 9.247957
+"parent": null
}
