Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Emmanuel Neron"'
Autor:
Ameur Soukhal, Emmanuel Neron, Hafedh Mohamed Babou, Ronan Bocquillon, Mohamed Lemine Ahmed Sidi, Mohamedade Farouk Nanne, Cheikh Dhib
Publikováno v:
Computers and Operations Research
Computers and Operations Research, Elsevier, 2022, 138, pp.105584. ⟨10.1016/j.cor.2021.105584⟩
Computers and Operations Research, Elsevier, 2022, 138, pp.105584. ⟨10.1016/j.cor.2021.105584⟩
Network comparison is an essential issue in the analysis of biological, social, and communication networks, and recent network comparisons have required the simultaneous mining of several networks on a similar vertex set. In this work, we study the c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96ec9ddbe2a3d73904f2096f7f437f72
https://hal.archives-ouvertes.fr/hal-03442570
https://hal.archives-ouvertes.fr/hal-03442570
Autor:
Meya Haroune, Cheikh Dhib, Emmanuel Neron, Ameur Soukhal, Hafed Mohamed Babou, Farouk Mohamedade Nanne
Publikováno v:
International Journal of Advanced Computer Science and Applications. 13
Publikováno v:
INFORMS Journal on Computing
INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2021
HAL
INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2021
HAL
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a4e64e83054c5f4e0bb54ac99d56a27d
https://hal.archives-ouvertes.fr/hal-03162962
https://hal.archives-ouvertes.fr/hal-03162962
Publikováno v:
OR Spectrum. 39:231-272
Since the 1990s, problems regarding the evacuation of persons have been extensively studied in the literature. The proposed models can be classified into two main categories: macroscopic and microscopic models. The DSS_Evac_Logistic project (2015, ht
Publikováno v:
Verolog 2017
Verolog 2017, Jul 2017, Amsterdam, Netherlands
HAL
Verolog 2017, Jul 2017, Amsterdam, Netherlands
HAL
International audience; Plan a cycling-tourist trip over several days taking into account tourism features (ie greenways, points of interest, ...) or specific bike features (ie secure roads, distance, ...) can be a difficult task.In collaboration wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1b712f665d3b51e611a93bd40cc3f03d
https://hal.archives-ouvertes.fr/hal-01500793
https://hal.archives-ouvertes.fr/hal-01500793
Publikováno v:
ROADEF 2017
ROADEF 2017, Feb 2017, Metz, France
HAL
ROADEF 2017, Feb 2017, Metz, France
HAL
National audience; Planifier un itinéraire touristique sur plusieurs jours en tenant compte de caractéristiques spécifiques au tourisme (i.e. point de vue, points d'intérêt à visiter, etc.) ou au vélo (i.e. routes sécurisées/cyclables, limit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2890d69775b03ea129e4b4e4244c3760
https://hal.archives-ouvertes.fr/hal-01411231
https://hal.archives-ouvertes.fr/hal-01411231
Publikováno v:
Transportation Research Procedia. 2:486-494
The first thing to do when natural disasters like landslides, earthquakes, floodings or tsunamis strike an area is to evacuate victims. However, due to damages on roads (crumbling, falling trees, or flooded roads) the evacuation itself can become dan
Publikováno v:
Journal of Scheduling
Journal of Scheduling, Springer Verlag, 2014, 17, pp.237-248. ⟨10.1007/s10951-013-0354-9⟩
Journal of Scheduling, Springer Verlag, 2014, 17, pp.237-248. ⟨10.1007/s10951-013-0354-9⟩
International audience; The Resource Constrained Project Scheduling Problem is one of the most intensively investigated schedul- ing problems. It requires scheduling a set of interrelated activities, while considering precedence relationships, and li
Publikováno v:
VeRoLog
VeRoLog, Jun 2016, Nantes, France
HAL
VeRoLog, Jun 2016, Nantes, France
HAL
International audience; To compute short paths on road networks in a cycling context, several criteria can be used like the distance, the security or the attractiveness of a route. Thus, a Multi Objective Shortest Path problem should be solved. We pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::53484c0aca27361ea859f941b7f109fe
https://hal.archives-ouvertes.fr/hal-01311332
https://hal.archives-ouvertes.fr/hal-01311332