hal.structure.identifier | autre | |
dc.contributor.author | Demange, Marc | |
hal.structure.identifier | Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE] | |
dc.contributor.author | Haddad, Marcel Adonis | |
hal.structure.identifier | Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE] | |
dc.contributor.author | Murat, Cécile | |
dc.date.accessioned | 2019-11-13T10:38:53Z | |
dc.date.available | 2019-11-13T10:38:53Z | |
dc.date.issued | 2018 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/20215 | |
dc.language.iso | en | en |
dc.subject | Wildfire management | en |
dc.subject | k-centre problem | en |
dc.subject | probabilistic combinatorial optimisation | en |
dc.subject.ddc | 511 | en |
dc.title | The probabilistic k-center problem | en |
dc.type | Communication / Conférence | |
dc.description.abstracten | The k-Center problem on a graph is to nd a set K of k vertices minimizing the radius dened as the maximum distance between any vertex and K. We propose a probabilistic combinatorial optimization model for this problem, with uncertainty on vertices. This model is inspired by a wildre management problem. The graph represents the adjacency of zones of a landscape, where each vertex represents a zone. We consider a nite set of re scenarios with related probabilities. Given a k-center, its radius may change in some scenarios since some evacuation paths become impracticable. The objective is to nd a robust k-center that minimizes the expected value of the radius over all scenarios. We study this new problem with scenarios limited to a single burning vertex. First results deal with explicit solutions on paths and cycles, and hardness on planar graphs. | en |
dc.identifier.citationpages | 62-74 | en |
dc.relation.ispartoftitle | Proceedings of the GEO-SAFE workshop - Robust Solutions for Fire Fighting (RSFF'18) | en |
dc.relation.ispartofeditor | Di Stefano, Gabriele | |
dc.relation.ispartofeditor | Navarra, Alfredo | |
dc.relation.ispartofpublname | CEUR-WS.org | en |
dc.relation.ispartofdate | 2018 | |
dc.relation.ispartofpages | 103 | en |
dc.subject.ddclabel | Principes généraux des mathématiques | en |
dc.relation.conftitle | GEO-SAFE workshop - Robust Solutions for Fire Fighting (RSFF'18) | en |
dc.relation.confdate | 2018-07 | |
dc.relation.confcity | L'Aquila | en |
dc.relation.confcountry | Italy | en |
dc.relation.forthcoming | non | en |
dc.description.ssrncandidate | non | en |
dc.description.halcandidate | oui | en |
dc.description.readership | recherche | en |
dc.description.audience | International | en |
dc.relation.Isversionofjnlpeerreviewed | non | en |
dc.relation.Isversionofjnlpeerreviewed | non | en |
dc.date.updated | 2019-11-13T10:27:46Z | |
hal.identifier | hal-02361200 | * |
hal.version | 1 | * |
hal.update.action | updateFiles | * |
hal.author.function | aut | |
hal.author.function | aut | |
hal.author.function | aut | |