default search action
I. Diarrassouba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Ibrahima Diarrassouba, Youssouf Hadhbi
, Ali Ridha Mahjoub:
Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem. J. Comb. Optim. 47(4): 56 (2024) - [j17]I. Diarrassouba, Ali Ridha Mahjoub, Intesar M. Al-Mudahka:
Optimization algorithms for the k edge-connected L-hop-constrained network design problem. Soft Comput. 28(11-12): 7201-7225 (2024) - 2023
- [j16]Intesar M. Al-Mudahka
Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut. Comput. Ind. Eng. 184: 109585 (2023) - 2022
- [c10]Ibrahima Diarrassouba, Youssouf Hadhbi, Ali Ridha Mahjoub:
The Constrained-Routing and Spectrum Assignment Problem: Extended Formulation and Branch-and-Cut-and-Price Algorithm. CoDIT 2022: 926-931 - [c9]Ibrahima Diarrassouba, Youssouf Hadhbi:
The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm. ISCO 2022: 35-47 - 2021
- [j15]Hamdi Dkhil, Ibrahima Diarrassouba, S. Benmansour, Adnan Yassine:
Modelling and solving a berth allocation problem in an automotive transshipment terminal. J. Oper. Res. Soc. 72(3): 580-593 (2021) - 2020
- [c8]Chaghoub Soraya, Ibrahima Diarrassouba:
A Polyhedral Study for the Buy-at-Bulk Facility Location Problem. ISCO 2020: 42-53
2010 – 2019
- 2019
- [j14]Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub
A parallel hybrid optimization algorithm for some network design problems. Soft Comput. 23(6): 1947-1964 (2019) - 2018
- [j13]Ibrahima Diarrassouba, Meriem Mahjoub
k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut. Ann. des Télécommunications 73(1-2): 5-28 (2018) - [j12]Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub:
A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem. Electron. Notes Discret. Math. 64: 305-314 (2018) - [j11]Ibrahima Diarrassouba, Pedro Henrique P. V. Liguori, Ali Ridha Mahjoub:
The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut. Electron. Notes Discret. Math. 64: 315-324 (2018) - [c7]Abderrahmen Belfkih, Ibrahima Diarrassouba, Adnan Yassine, Cédric Joncour:
A model for optimal feeder vessel management in container terminals. GOL 2018: 1-6 - [c6]Sara Tfaili, Abdelkader Sbihi
Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty. ICORES 2018: 144-151 - [c5]Sara Tfaili, Abdelkader Sbihi
An Efficient Algorithm Based Tabu Search for the Robust Sparse CARP Under Travel Costs Uncertainty. ICORES (Selected Papers) 2018: 153-174 - 2017
- [j10]Meriem Mahjoub, I. Diarrassouba, Ali Ridha Mahjoub, Raouia Taktak:
The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut. Comput. Ind. Eng. 112: 690-705 (2017) - [j9]Ibrahima Diarrassouba:
The separation problem of rounded capacity inequalities: Some polynomial cases. Discret. Optim. 23: 33-55 (2017) - [j8]Ibrahima Diarrassouba:
On the complexity of the separation problem for rounded capacity inequalities. Discret. Optim. 25: 86-104 (2017) - 2016
- [j7]Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Raouia Taktak:
The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut. Electron. Notes Discret. Math. 52: 117-124 (2016) - [j6]I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. Networks 67(2): 148-169 (2016) - [j5]Ibrahima Diarrassouba, Hakan Kutucu
Two node-disjoint hop-constrained survivable network design and polyhedra. Networks 67(4): 316-337 (2016) - [c4]Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub:
The k-node-connected subgraph problem: Facets and Branch-and-Cut. DRCN 2016: 1-8 - [c3]Mohamed Khalil Labidi, Ibrahima Diarrassouba, Ali Ridha Mahjoub, Anissa Omrane:
A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem. GECCO 2016: 685-692 - 2014
- [c2]Ndèye Fatma Ndiaye, Adnan Yassine, Ibrahima Diarrassouba:
A hybrid ant colony and genetic algorithm to solve the container stacking problem at seaport terminal. ICALT 2014: 247-252 - 2013
- [j4]Ibrahima Diarrassouba, Ali Lourimi, Ali Ridha Mahjoub, Habib Youssef:
Hose workload based exact algorithm for the optimal design of virtual private networks. Comput. Networks 57(14): 2766-2774 (2013) - [j3]Ibrahima Diarrassouba, Hakan Kutucu
Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra. Electron. Notes Discret. Math. 41: 551-558 (2013) - 2010
- [j2]Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Jean Mailfert:
The k edge-disjoint 3-hop-constrained paths polytope. Discret. Optim. 7(4): 222-233 (2010) - [j1]Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert:
A branch-and-cut algorithm for the k-edge connected subgraph problem. Networks 55(1): 13-32 (2010)
2000 – 2009
- 2009
- [b1]Ibrahima Diarrassouba:
Survivale Network Design Problems with High Connectivity Requirement. Blaise Pascal University, Clermont-Ferrand, France, 2009 - 2007
- [c1]Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert:
The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. DRCN 2007: 1-8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-06 21:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: