Zobrazeno 1 - 10
of 188
pro vyhledávání: '"Juan José Salazar González"'
Autor:
Hand, David J.
Publikováno v:
International Statistical Review / Revue Internationale de Statistique, 2012 Dec 01. 80(3), 479-480.
Externí odkaz:
http://dx.doi.org/10.1111/j.1751-5823.2012.00196_11.x
Autor:
David J. Hand
Publikováno v:
International Statistical Review. 80:479-480
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f283c6eb81614bd814527d237c9fed89
https://doi.org/10.1111/j.1751-5823.2012.00196_11.x
https://doi.org/10.1111/j.1751-5823.2012.00196_11.x
Autor:
Jesús Iván Lara-Prado, Fabiola Pazos-Pérez, Carlos Enrique Méndez-Landa, Dulce Paola Grajales-García, José Alfredo Feria-Ramírez, Juan José Salazar-González, Mario Cruz-Romero, Alejandro Treviño-Becerra
Publikováno v:
Toxins, Vol 13, Iss 8, p 551 (2021)
Acute kidney injury (AKI), defined as an abrupt increase in serum creatinine, a reduced urinary output, or both, is experiencing considerable evolution in terms of our understanding of the pathophysiological mechanisms and its impact on other organs.
Externí odkaz:
https://doaj.org/article/4bedb304f83d40508c15da5942ad8945
Publikováno v:
European Journal of Operational Research. 297:467-483
This paper deals with the problem of designing a minimum-cost route for a capacitated vehicle moving a commodity between a set of customers, allowing two features uncommon in the pickup-and-delivery literature. One feature is that a customer accepts
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93b5f1434e934df4225795f2f00feed0
https://doi.org/10.1016/j.ejor.2021.05.040
https://doi.org/10.1016/j.ejor.2021.05.040
Publikováno v:
Medicina Clínica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a75068e74a0145b9131a17ba3ae6336
https://doi.org/10.1016/j.medcli.2023.02.013
https://doi.org/10.1016/j.medcli.2023.02.013
Publikováno v:
European Journal of Operational Research. 289:470-484
This paper addresses the design of routes for a fleet of vehicles serving customer requests. It is a pickup and delivery problem where each customer location can be visited several times, and load may be transshipped from one vehicle to another at sp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::800cb7e9b58a71a2ec7ea054ff097dc1
https://doi.org/10.1016/j.ejor.2020.07.032
https://doi.org/10.1016/j.ejor.2020.07.032
Autor:
A. V. Russo Cabrera, Carme Gallart, M. Luis Aznar, Matteo Monelli, T. K. Fritz, Giuseppina Battaglia, T. Ruiz-Lara, Santi Cassisi, Inmaculada Rodríguez-Martín, Juan-José Salazar-González
Publikováno v:
Monthly Notices of the Royal Astronomical Society, 501(3), 3962-3980. Oxford University Press
Leo I is considered one of the youngest dwarf spheroidals (dSph) in the Local Group. Its isolation, extended star formation history (SFH), and recent perigalacticon passage (~1 Gyr ago) make Leo~I one of the most interesting nearby stellar systems. H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a77e690195367cfd2448ee45dd315c95
https://doi.org/10.1093/mnras/staa3871
https://doi.org/10.1093/mnras/staa3871
Publikováno v:
Computers & Operations Research. 150:106076
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08e0db75ce7b026a8d0c2a26fbba79ac
https://doi.org/10.1016/j.cor.2022.106076
https://doi.org/10.1016/j.cor.2022.106076
Publikováno v:
Expert Systems with Applications. 121:313-323
Transportation problems are essential in commercial logistics and have been widely studied in the literature during the last decades. Many of them consist in designing routes for vehicles to move commodities between locations. This article approaches
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87a687c93d82aae665b94e5b520d581d
https://doi.org/10.1016/j.eswa.2018.12.028
https://doi.org/10.1016/j.eswa.2018.12.028
Publikováno v:
European Journal of Operational Research. 272:24-31
The Capacitated Vehicle Routing Problem (CVRP) is a classic combinatorial optimization problem for which many heuristics, relaxations and exact algorithms have been proposed. Since the CVRP is NP-hard in the strong sense, a natural research topic is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35d52815e7c285f84c3b1f80c2c4e401
https://doi.org/10.1016/j.ejor.2018.06.002
https://doi.org/10.1016/j.ejor.2018.06.002