Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Ali Ridha Mahjoub"'
Publikováno v:
2022 8th International Conference on Control, Decision and Information Technologies (CoDIT).
Publikováno v:
Discrete Applied Mathematics. 290:86-111
We are given a graph G = ( V ∪ T , E ) , with V ∪ T the set of vertices where T is a set of terminals and E the set of edges. The multi-terminal vertex separator problem consists in finding a subset of vertices S ⊆ V of minimum size intersectin
Publikováno v:
Computers & Industrial Engineering. 124:582-603
Telecommunication networks can be seen as the stacking of several layers like, for instance, IP-over-Optical networks. This infrastructure should have sufficient capacities to route some demands between their origin-destination nodes. In this paper w
This book constitutes the refereed proceedings of the 8th International Symposium on Combinatorial Optimization, ISCO 2024, held in La Laguna, Tenerife, Spain, during May 22–24, 2024. The 30 full papers included in this book were carefully reviewed
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2018, 240, ⟨10.1016/j.dam.2017.02.011⟩
Discrete Applied Mathematics, 2018, 240, ⟨10.1016/j.dam.2017.02.011⟩
Discrete Applied Mathematics, Elsevier, 2018, 240, ⟨10.1016/j.dam.2017.02.011⟩
Discrete Applied Mathematics, 2018, 240, ⟨10.1016/j.dam.2017.02.011⟩
We give a structural characterization of the inclusionwise minimal arc subsets whose vertices induce a subgraph containing at least one directed cycle. These arc sets arise in a linear formulation of a binary quadratic problem.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f69b3970d52f389a84db666835409a6
https://hal.archives-ouvertes.fr/hal-02098319
https://hal.archives-ouvertes.fr/hal-02098319
Publikováno v:
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics, 2018, 64, pp.305--314. ⟨10.1016/j.endm.2018.02.005⟩
Electronic Notes in Discrete Mathematics, 2018, 64, pp.305--314. ⟨10.1016/j.endm.2018.02.005⟩
In this paper, we consider the Steiner k-Edge-Connected Network Design Problem (SkESNDP). The problem finds its applications in the design of survivable telecommunications networks. We propose a parallel hybrid algorithm which aims to produce good so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e8f52861e58900ee8f27e9848bf8ea4
https://hal.archives-ouvertes.fr/hal-02436334
https://hal.archives-ouvertes.fr/hal-02436334
Publikováno v:
Computers & Industrial Engineering
Computers & Industrial Engineering, Elsevier, 2017, 112, pp.690--705. ⟨10.1016/j.cie.2017.03.007⟩
Computers & Industrial Engineering, Elsevier, 2017, 112, pp.690--705. ⟨10.1016/j.cie.2017.03.007⟩
In this paper we consider the k -node-connected subgraph problem. We propose an integer linear programming formulation for the problem and investigate the associated polytope. We introduce further classes of valid inequalities and discuss their facia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cf9e38506d4812ac605e836b17689fc
https://hal.archives-ouvertes.fr/hal-02304487
https://hal.archives-ouvertes.fr/hal-02304487
Publikováno v:
INFORMS Journal on Computing
INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2014, 26 (1), ⟨10.1287/ijoc.1120.0541⟩
INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2014, 26 (1), ⟨10.1287/ijoc.1120.0541⟩
Cataloged from PDF version of article. The motivation behind this study is the essential need for survivability in the telecommunications networks. An optical signal should find its destination even if the network experiences an occasional fiber cut.
Publikováno v:
GECCO
Network design problems have been largely studied in the last decades due to the ubiquity of IT communication in our daily life. We address in this paper the k-edge-connected hop-constrained network design problem (kHNDP) which is known to be NP-hard
Autor:
Ibrahima Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Borges Gouveia, Pierre Pesneau
Publikováno v:
Networks
Networks, Wiley, 2016, 67 (2), pp. 148-169. ⟨10.1002/net.21667⟩
Networks, Wiley, 2016, 67 (2), 〈10.1002/net.21667〉
Networks, 2016, 67 (2), pp. 148-169. ⟨10.1002/net.21667⟩
Networks, Wiley, 2016, 67 (2), pp. 148-169. ⟨10.1002/net.21667⟩
Networks, Wiley, 2016, 67 (2), 〈10.1002/net.21667〉
Networks, 2016, 67 (2), pp. 148-169. ⟨10.1002/net.21667⟩
International audience; In this article, we study the k-edge-connected L-hop-constrained network design problem. Given a weighted graph G = (V,E), a set D of pairs of nodes, two integers L ≥ 2 and k ≥ 2, the problem consists in finding a minimum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a89f73c5e04724bce317c3032bfe442
https://hal.inria.fr/hal-01281958
https://hal.inria.fr/hal-01281958