I. Diarrassouba

According to our database, I. Diarrassouba authored at least 29 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Optimization algorithms for the k edge-connected L-hop-constrained network design problem.

I. Diarrassouba, Ali Ridha Mahjoub, Intesar M. Al-Mudahka

Soft Comput., June, 2024

Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem.

Ibrahima Diarrassouba, Youssouf Hadhbi, Ali Ridha Mahjoub

J. Comb. Optim., May, 2024

2023

Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut.

Intesar M. Al-Mudahka, Ibrahima Diarrassouba, Ali Ridha Mahjoub, Raouia Taktak

Comput. Ind. Eng., October, 2023

2022

The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm.

Ibrahima Diarrassouba, Youssouf Hadhbi

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

The Constrained-Routing and Spectrum Assignment Problem: Extended Formulation and Branch-and-Cut-and-Price Algorithm.

Ibrahima Diarrassouba, Youssouf Hadhbi, Ali Ridha Mahjoub

Proceedings of the 8th International Conference on Control, 2022

2021

Modelling and solving a berth allocation problem in an automotive transshipment terminal.

Hamdi Dkhil, Ibrahima Diarrassouba, S. Benmansour, Adnan Yassine

J. Oper. Res. Soc., 2021

2020

A Polyhedral Study for the Buy-at-Bulk Facility Location Problem.

Chaghoub Soraya, Ibrahima Diarrassouba

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

A parallel hybrid optimization algorithm for some network design problems.

Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub

Soft Comput., 2019

2018

The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut.

Ibrahima Diarrassouba, Pedro Henrique P. V. Liguori, Ali Ridha Mahjoub

Electron. Notes Discret. Math., 2018

A Hybrid Optimization Approach For the Steiner <i>k</i>-Connected Network Design Problem.

Ibrahima Diarrassouba, Mohamed Khalil Labidi, Ali Ridha Mahjoub

Electron. Notes Discret. Math., 2018

k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut.

Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Hande Yaman

Ann. des Télécommunications, 2018

An Efficient Algorithm Based Tabu Search for the Robust Sparse CARP Under Travel Costs Uncertainty.

Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba

Proceedings of the Operations Research and Enterprise Systems, 2018

Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty.

Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba

Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

A model for optimal feeder vessel management in container terminals.

Abderrahmen Belfkih, Ibrahima Diarrassouba, Adnan Yassine, Cédric Joncour

Proceedings of the 4th International Conference on Logistics Operations Management, 2018

2017

On the complexity of the separation problem for rounded capacity inequalities.

Ibrahima Diarrassouba

Discret. Optim., 2017

The separation problem of rounded capacity inequalities: Some polynomial cases.

Ibrahima Diarrassouba

Discret. Optim., 2017

The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut.

Meriem Mahjoub, I. Diarrassouba, Ali Ridha Mahjoub, Raouia Taktak

Comput. Ind. Eng., 2017

2016

Two node-disjoint hop-constrained survivable network design and polyhedra.

Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub

Networks, 2016

Integer programming formulations for the <i>k</i>-edge-connected 3-hop-constrained network design problem.

I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia, Pierre Pesneau

Networks, 2016

The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut.

Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Raouia Taktak

Electron. Notes Discret. Math., 2016

A Parallel Hybrid Genetic Algorithm for the k-Edge-Connected Hop-Constrained Network Design Problem.

Mohamed Khalil Labidi, Ibrahima Diarrassouba, Ali Ridha Mahjoub, Anissa Omrane

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

The k-node-connected subgraph problem: Facets and Branch-and-Cut.

Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub

Proceedings of the 12th International Conference on the Design of Reliable Communication Networks, 2016

2014

A hybrid ant colony and genetic algorithm to solve the container stacking problem at seaport terminal.

Ndèye Fatma Ndiaye, Adnan Yassine, Ibrahima Diarrassouba

Proceedings of the International Conference on Advanced Logistics and Transport, 2014

2013

Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra.

Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub

Electron. Notes Discret. Math., 2013

Hose workload based exact algorithm for the optimal design of virtual private networks.

Ibrahima Diarrassouba, Ali Lourimi, Ali Ridha Mahjoub, Habib Youssef

Comput. Networks, 2013

2010

A branch-and-cut algorithm for the <i>k</i>-edge connected subgraph problem.

Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert

Networks, 2010

The k edge-disjoint 3-hop-constrained paths polytope.

Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Jean Mailfert

Discret. Optim., 2010

2009

Survivale Network Design Problems with High Connectivity Requirement.

Ibrahima Diarrassouba

PhD thesis, 2009

2007

The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut.

Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert

Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007