Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Francisco Barahona"'
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
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
Autor:
Francisco Barahona, Mourad Baïou
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2019, 81 (3), pp.1232-1246. ⟨10.1007/s00453-018-0466-x⟩
Algorithmica, 2019, 81 (3), pp.1232-1246. ⟨10.1007/s00453-018-0466-x⟩
Algorithmica, Springer Verlag, 2019, 81 (3), pp.1232-1246. ⟨10.1007/s00453-018-0466-x⟩
Algorithmica, 2019, 81 (3), pp.1232-1246. ⟨10.1007/s00453-018-0466-x⟩
Given a matroid M defined by an independence oracle on a ground set E, the Matroid Base Game is played by two players: the defender chooses a basis B and (simultaneously) the attacker chooses an element $$e \in E$$ . The attacker incurs a cost c(e) f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::286b428716c985394606d203614d520e
https://hal.archives-ouvertes.fr/hal-02348947
https://hal.archives-ouvertes.fr/hal-02348947
Autor:
Mourad Baïou, Francisco Barahona
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2019, 81 (8), pp.3099-3113. ⟨10.1007/s00453-019-00574-9⟩
Algorithmica, 2019, 81 (8), pp.3099-3113. ⟨10.1007/s00453-019-00574-9⟩
Algorithmica, Springer Verlag, 2019, 81 (8), pp.3099-3113. ⟨10.1007/s00453-019-00574-9⟩
Algorithmica, 2019, 81 (8), pp.3099-3113. ⟨10.1007/s00453-019-00574-9⟩
International audience; We study a type of cooperative games introduced in [9] called shortest path games. They arise on a network that has two special nodes s and t. A coalition corresponds to a set of arcs and it receives a reward if it can connect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3aad92f2bd67fd51a10e5449c31fc8e6
https://hal.archives-ouvertes.fr/hal-02348972
https://hal.archives-ouvertes.fr/hal-02348972
Publikováno v:
Repositorio de Resultados de Investigación del INIA
Instituto Nacional de Investigación y Tecnología Agraria y Alimentaria INIA
INIA: Repositorio de Resultados de Investigación del INIA
Instituto Nacional de Investigación y Tecnología Agraria y Alimentaria INIA
INIA: Repositorio de Resultados de Investigación del INIA
In this work, novel molecularly imprinted polymer-coated hollow fibers (MIP-HFs) have been preparedand evaluated for the development of a micro-solid phase extraction method for the analysis of triazines inaqueous samples using high performance liqui
Autor:
Douglas Gilliland, Otmar Geiss, Francisco Barahona, Isaac Ojea-Jiménez, Josefa Barrero-Moreno
Publikováno v:
Journal of Chromatography A. 1432:92-100
Synthetic amorphous silica (SAS) has been used as food additive under the code E551 for decades and the agrifood sector is considered a main exposure vector for humans and environment. However, there is still a lack of detailed methodologies for the
Autor:
Mourad Baïou, Francisco Barahona
Publikováno v:
Networks
Networks, 2018, 71 (4), pp.326-345. ⟨10.1002/net.21813⟩
Networks, Wiley, 2018, 71 (4), pp.326-345. ⟨10.1002/net.21813⟩
Networks, 2018, 71 (4), pp.326-345. ⟨10.1002/net.21813⟩
Networks, Wiley, 2018, 71 (4), pp.326-345. ⟨10.1002/net.21813⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70daadf9cb974b246220fda0cb645066
https://hal.science/hal-02349301
https://hal.science/hal-02349301