Zobrazeno 1 - 10
of 104
pro vyhledávání: '"Francisco Barahona"'
Autor:
Mourad Baïou, Francisco Barahona
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031248658
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46df7ce3c183c9f2bd6cd20671a44c7a
https://doi.org/10.1007/978-3-031-24866-5_37
https://doi.org/10.1007/978-3-031-24866-5_37
Autor:
Mourad Baiou, Francisco Barahona
Publikováno v:
Discrete Mathematics
Discrete Mathematics, 2023, 346 (2), pp.113222. ⟨10.1016/j.disc.2022.113222⟩
Discrete Mathematics, 2023, 346 (2), pp.113222. ⟨10.1016/j.disc.2022.113222⟩
International audience; Hypergraphics matroids were studied first by Lorea [18] and later by Frank et al [8]. They can be seen as generalizations of graphic matroids. Here we show that several algorithms developed for the graphic case can be extended
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfd28a3c4d3ce0da01ff514310c24b41
http://arxiv.org/abs/2111.05699
http://arxiv.org/abs/2111.05699
Publikováno v:
International Transactions in Operational Research
International Transactions in Operational Research, 2021, 28 (1), pp.296-326. ⟨10.1111/itor.12770⟩
International Transactions in Operational Research, Wiley, 2021, 28 (1), pp.296-326. ⟨10.1111/itor.12770⟩
International Transactions in Operational Research, 2021, 28 (1), pp.296-326. ⟨10.1111/itor.12770⟩
International Transactions in Operational Research, Wiley, 2021, 28 (1), pp.296-326. ⟨10.1111/itor.12770⟩
International audience; The Bundle Method and the Volume Algorithm are among the most efficient techniques to obtain accurate Lagrangian dual bounds for hard combinatorial optimization problems. We propose here to compare their performance on very la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3eba2380918c6968c220449548b6f5dd
https://hal.science/hal-03046371/file/ITOR.pdf
https://hal.science/hal-03046371/file/ITOR.pdf
Autor:
Francisco Barahona, Mourad Baïou
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2020, ⟨10.1016/j.dam.2020.05.008⟩
Discrete Applied Mathematics, 2022, ⟨10.1016/j.dam.2020.05.008⟩
Discrete Applied Mathematics, Elsevier, 2020, ⟨10.1016/j.dam.2020.05.008⟩
Discrete Applied Mathematics, 2022, ⟨10.1016/j.dam.2020.05.008⟩
International audience; We study a Network Security question that consists of learning where are the most important locations to place checkpoints to intercept an adversary traveling from an origin to a destination. For that we define a multi-agent c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06005ae9a62dacf9627ab024fc5b09bb
https://hal.archives-ouvertes.fr/hal-03454414
https://hal.archives-ouvertes.fr/hal-03454414
Autor:
Francisco Barahona, Mourad Baïou
Publikováno v:
Mathematical Programming
Mathematical Programming, 2020, 180, pp.117-136. ⟨10.1007/s10107-018-1348-3⟩
Mathematical Programming, Springer Verlag, 2020, 180, pp.117-136. ⟨10.1007/s10107-018-1348-3⟩
Mathematical Programming, 2020, 180, pp.117-136. ⟨10.1007/s10107-018-1348-3⟩
Mathematical Programming, Springer Verlag, 2020, 180, pp.117-136. ⟨10.1007/s10107-018-1348-3⟩
The maximum number of edge-disjoint spanning trees in a network has been used as a measure of the strength of a network. It gives the number of disjoint ways that the network can be fully connected. This suggests a game theoretic analysis that shows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::172ca19d036639042c45e99d1174b59a
https://hal.science/hal-02349040
https://hal.science/hal-02349040
Autor:
Francisco Barahona, Mourad Baïou
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
6th International Symposium, ISCO 2020, Lecture Notes in Computer Science 12176, Springer
6th International Symposium, ISCO 2020, Lecture Notes in Computer Science 12176, Springer, pp.15-26, 2020, ⟨10.1007/978-3-030-53262-8_2⟩
ISCO
6th International Symposium, ISCO 2020, Lecture Notes in Computer Science 12176, Springer
6th International Symposium, ISCO 2020, Lecture Notes in Computer Science 12176, Springer, pp.15-26, 2020, ⟨10.1007/978-3-030-53262-8_2⟩
We study the effect of the odd directed cycle inequalities in the description of the polytope associated with the p-median problem. We treat general directed graphs and we characterize all the graphs for which the obvious linear relaxation together w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a751a7eb9e39eb7fdd37a436bbef9e2c
https://doi.org/10.1007/978-3-030-53262-8_2
https://doi.org/10.1007/978-3-030-53262-8_2
This book constitutes thoroughly refereed and revised selected papers from the 7th International Symposium on Combinatorial Optimization, ISCO 2022, which was held online during May 18–20, 2022.The 24 full papers included in this book were carefull
Autor:
Roberto Moncayo, Francisco Barahona, Karen Castillo, Santiago García-Herreros, Homero Loza, José Julio Serrano
En San Juan, junto al Centro Histórico de Quito, inicié mi vida profesional, en la consulta privada y las visitas domiciliarias, actividad que me exigió una preparación rigurosa para la comprensión clínica de las diversas patologías. A princip
Autor:
Francisco Barahona, Mourad Baou
Publikováno v:
Discrete Optimization. 22:206-224
We study the effect of the odd directed cycle inequalities in the description of the polytope associated with the p-median problem. We treat oriented graphs, i.e., if (u,v) is in the arc-set, then (v,u) is not in the arc-set. We characterize the orie
Esta dissertação, no âmbito académico do mestrado em Ciências da Comunicação – especialização em Comunicação e Artes, desenvolve um pouco do que é a imagem na sociedade contemporânea. Tendo o seu apogeu no Instagram, o tratamento da im
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1437::31d67494ff579985dd84535c19b7346d
https://hdl.handle.net/10362/82085
https://hdl.handle.net/10362/82085