Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Mercedes Pelegrín"'
Autor:
Mercedes Pelegrín
Publikováno v:
European Journal of Operational Research. 306:1094-1108
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a5960a58e3561e2a83eb481dde6467f
https://doi.org/10.1016/j.ejor.2022.10.027
https://doi.org/10.1016/j.ejor.2022.10.027
Autor:
Mercedes Pelegrín, Martina Cerulli
Publikováno v:
INFORMS Journal on Computing. 35:274-285
Aircraft conflict resolution is one of the major tasks of computer-aided air traffic management and represents a challenging optimization problem. Many models and methods have been proposed to assist trajectory regulation to avoid conflicts. However,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfeab0d698dacbccc7b396ce4034c991
https://doi.org/10.1287/ijoc.2022.1265
https://doi.org/10.1287/ijoc.2022.1265
Autor:
Mercedes Pelegrín, Claudia D’Ambrosio
Publikováno v:
Transportation Science. 56:118-140
Computer-aided air traffic management has increasingly attracted the interest of the operations research community. This includes, among other tasks, the design of decision support tools for the detection and resolution of conflict situations during
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d8da5b09f5da32b26d20b1686a50452
https://doi.org/10.1287/trsc.2021.1056
https://doi.org/10.1287/trsc.2021.1056
Publikováno v:
Encyclopedia of Optimization ISBN: 9783030546212
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eea51167202a7ab1819ee7598b6195c2
https://doi.org/10.1007/978-3-030-54621-2_748-1
https://doi.org/10.1007/978-3-030-54621-2_748-1
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, 2021, ⟨10.1016/j.ejor.2020.07.001⟩
European Journal of Operational Research, Elsevier, 2021, ⟨10.1016/j.ejor.2020.07.001⟩
European journal of operational research
European Journal of Operational Research, 2021, ⟨10.1016/j.ejor.2020.07.001⟩
European Journal of Operational Research, Elsevier, 2021, ⟨10.1016/j.ejor.2020.07.001⟩
European journal of operational research
The line graph of a graph G has one node per each edge of G, two of them being adjacent only when the corresponding edges have a node of G in common. In this work, we consider the problem of finding the minimum number of edges to delete so that the r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75c8af2662b551c39d44d23327fa0b75
https://doi.org/10.1016/j.ejor.2020.07.001
https://doi.org/10.1016/j.ejor.2020.07.001
Autor:
Mercedes Pelegrín, Liding Xu
Covering problems are well-studied in the domain of Operations Research, and, more specifically, in Location Science. When the location space is a network, the most frequent assumption is to consider the candidate facility locations, the points to be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3288d108217eb39b471720f2ca8838ed
http://arxiv.org/abs/2203.00284
http://arxiv.org/abs/2203.00284
Autor:
Mercedes Pelegrín, Liding Xu
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74b326f3a9cb12dd441643fc014a9416
https://doi.org/10.2139/ssrn.4055264
https://doi.org/10.2139/ssrn.4055264
Autor:
Alfredo Marín, Mercedes Pelegrín
Publikováno v:
Computers & Operations Research. 104:174-190
We propose and study a new variant of the Simple Plant Location Problem (SPLP). The problem we tackle, which we call Simple Plant Location Problem with Incompatibilities (SPLPI), differs from the classic version in the fact that possible incompatibil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8588f73bc60700d44812d6ef2c4f4407
https://doi.org/10.1016/j.cor.2018.12.018
https://doi.org/10.1016/j.cor.2018.12.018
Autor:
Alfredo Marín, Mercedes Pelegrín
Publikováno v:
Computers and Operations Research
Computers and Operations Research, Elsevier, 2021, 126, pp.105059-. ⟨10.1016/j.cor.2020.105059⟩
Computers and Operations Research, Elsevier, 2021, 126, pp.105059-. ⟨10.1016/j.cor.2020.105059⟩
In this paper, a new variant of the Simple Plant Location Problem is proposed. We consider additional conditions in the classic location-allocation problem for clients and facilities. Namely, some pairs have to be served by a common plant. The result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::406076238ebb7e1bbb3e08bbce904dce
https://hal.archives-ouvertes.fr/hal-03493309
https://hal.archives-ouvertes.fr/hal-03493309
Publikováno v:
Journal of Global Optimization
Journal of Global Optimization, Springer Verlag, 2021, ⟨10.1007/s10898-021-00997-1⟩
Journal of Global Optimization, Springer Verlag, 2021, ⟨10.1007/s10898-021-00997-1⟩
International audience; We present two bilevel programming formulations for the aircraft deconfliction problem: one based on speed regulation in k dimensions, the other on heading angle changes in 2 dimensions. We propose three reformulations of each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39d3c98a7d2f660d8afc4e34249c7e72
https://hal.archives-ouvertes.fr/hal-02869699v2/document
https://hal.archives-ouvertes.fr/hal-02869699v2/document