Ibrahima Diarrassouba

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 19

Top Venues

Electron. Notes Discret. Math.

ISCO

Discret. Optim.

J. Comb. Optim.

Blaise Pascal University, Clermont-Ferrand, France (PHD)

Education History

Blaise Pascal University, Clermont-Ferrand, France

PHD

Publications

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) (2024)
Intesar M. Al-Mudahka, Ibrahima Diarrassouba, Ali Ridha Mahjoub, Raouia Taktak
Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut. Comput. Ind. Eng. 184 (2023)
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)
Ibrahima Diarrassouba, Youssouf Hadhbi
The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm. ISCO (2022)
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) (2021)
Chaghoub Soraya, Ibrahima Diarrassouba
A Polyhedral Study for the Buy-at-Bulk Facility Location Problem. ISCO (2020)
Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub
A parallel hybrid optimization algorithm for some network design problems. Soft Comput. 23 (6) (2019)
Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub
-Connected Network Design Problem. Electron. Notes Discret. Math. 64 (2018)
Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba
Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty. ICORES (2018)
Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Hande Yaman
k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut. Ann. des Télécommunications 73 (1-2) (2018)
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 (2018)
Abderrahmen Belfkih, Ibrahima Diarrassouba, Adnan Yassine, Cédric Joncour
A model for optimal feeder vessel management in container terminals. GOL (2018)
Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba
An Efficient Algorithm Based Tabu Search for the Robust Sparse CARP Under Travel Costs Uncertainty. ICORES (Selected Papers) (2018)
Ibrahima Diarrassouba
The separation problem of rounded capacity inequalities: Some polynomial cases. Discret. Optim. 23 (2017)
Ibrahima Diarrassouba
On the complexity of the separation problem for rounded capacity inequalities. Discret. Optim. 25 (2017)
Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub
The k-node-connected subgraph problem: Facets and Branch-and-Cut. DRCN (2016)
Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub
Two node-disjoint hop-constrained survivable network design and polyhedra. Networks 67 (4) (2016)
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 (2016)
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)
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)
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) (2013)
Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub
Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra. Electron. Notes Discret. Math. 41 (2013)
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)

Ibrahima Diarrassouba.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ibrahima Diarrassouba