Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Murat, Cécile"'
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
Publikováno v:
In EURO Journal on Computational Optimization June 2020 8(2):103-139
Publikováno v:
In EURO Journal on Computational Optimization September 2018 6(3):267-290
Publikováno v:
In Future Generation Computer Systems March 2018 80:311-321
Publikováno v:
In Discrete Applied Mathematics 10 January 2018 234:93-113
Autor:
Murat, Cécile, Paschos, Vangelis Th.
Publikováno v:
In Discrete Applied Mathematics 2006 154(3):564-586
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