Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Haddad, Marcel A."'
The Probabilistic p-Center problem under Pressure (Min PpCP) is a variant of the usual p-Center problem we recently introduced in the context of wildfire management. The problem is to locate p shelters minimizing the maximum distance people will have
Externí odkaz:
http://arxiv.org/abs/2009.08751
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Combinatorial Optimization; Aug2024, Vol. 48 Issue 1, p1-25, 25p
Autor:
Haddad, Marcel Adonis
Publikováno v:
Operations Research [cs.RO]. Université Paris sciences et lettres; RMIT University (Melbourne), 2020. English. ⟨NNT : 2020UPSLD021⟩
The location of shelters in different areas threatened by wildfires is one of the possible ways to reduce fatalities in acontext of an increasing number of catastrophic and severe forest fires. The problem is basically to locate p sheltersminimizing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::950a56197106c906a833cc4fde9a4f2a
https://tel.archives-ouvertes.fr/tel-03259596
https://tel.archives-ouvertes.fr/tel-03259596
Publikováno v:
20ème congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF 2019)
ROADEF 2019
ROADEF 2019, Feb 2019, Le Havre, France
ROADEF 2019
ROADEF 2019, Feb 2019, Le Havre, France
International audience; Étant donné un graphe G= (V, E) orienté, on appelle distance la longueur d’un plus court chemin entre 2 sommets de V. Le problème du p-Centre, noté pCP, consiste à trouver un sous-ensemble de sommets C⊆V,|C|=p, qui m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8568451e447f1ec3a929c19565df60f3
https://hal.archives-ouvertes.fr/hal-02409166
https://hal.archives-ouvertes.fr/hal-02409166
Publikováno v:
Proceedings of the GEO-SAFE workshop-Robust Solutions for Fire Fighting (RSFF'18)
GEO-SAFE workshop-Robust Solutions for Fire Fighting (RSFF'18)
GEO-SAFE workshop-Robust Solutions for Fire Fighting (RSFF'18), Jul 2018, L'Aquila, Italy. pp.62-74
GEO-SAFE workshop-Robust Solutions for Fire Fighting (RSFF'18)
GEO-SAFE workshop-Robust Solutions for Fire Fighting (RSFF'18), Jul 2018, L'Aquila, Italy. pp.62-74
International audience; 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 un
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2515302d1b4fe67c0a5d36aa59569d9d
https://hal.archives-ouvertes.fr/hal-02361200
https://hal.archives-ouvertes.fr/hal-02361200
Publikováno v:
EURO Journal on Computational Optimization; Jun2020, Vol. 8 Issue 2, p103-139, 37p