The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. - Fatiha Bendali; Ibrahima Diarrassouba; Mohamed Didi Biha; Ali Ridha Mahjoub; Jean Mailfert (DRCN, 2007)

Survivale Network Design Problems with High Connectivity Requirement. - Ibrahima Diarrassouba (2009)

The k edge-disjoint 3-hop-constrained paths polytope. - Fatiha Bendali; I. Diarrassouba; Ali Ridha Mahjoub; Jean Mailfert (Discret. Optim., 2010)

A branch-and-cut algorithm for the k-edge connected subgraph problem. - Fatiha Bendali; I. Diarrassouba; Ali Ridha Mahjoub; Mohamed Didi Biha; Jean Mailfert (Networks, 2010)

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)

Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra. - Ibrahima Diarrassouba; Hakan Kutucu; Ali Ridha Mahjoub (Electron. Notes Discret. Math., 2013)

A hybrid ant colony and genetic algorithm to solve the container stacking problem at seaport terminal. - Ndèye Fatma Ndiaye; Adnan Yassine; Ibrahima Diarrassouba (ICALT, 2014)

The k-node-connected subgraph problem: Facets and Branch-and-Cut. - Ibrahima Diarrassouba; Meriem Mahjoub; Ali Ridha Mahjoub (DRCN, 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 (GECCO, 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)

Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. - I. Diarrassouba; Virginie Gabrel; Ali Ridha Mahjoub; Luis Eduardo Neves Gouveia; Pierre Pesneau (Networks, 2016)

Two node-disjoint hop-constrained survivable network design and polyhedra. - Ibrahima Diarrassouba; Hakan Kutucu; Ali Ridha Mahjoub (Networks, 2016)

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)

The separation problem of rounded capacity inequalities: Some polynomial cases. - Ibrahima Diarrassouba (Discret. Optim., 2017)

On the complexity of the separation problem for rounded capacity inequalities. - Ibrahima Diarrassouba (Discret. Optim., 2017)

A model for optimal feeder vessel management in container terminals. - Abderrahmen Belfkih; Ibrahima Diarrassouba; Adnan Yassine; Cédric Joncour (GOL, 2018)

Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty. - Sara Tfaili; Abdelkader Sbihi; Adnan Yassine; Ibrahima Diarrassouba (ICORES, 2018)

An Efficient Algorithm Based Tabu Search for the Robust Sparse CARP Under Travel Costs Uncertainty. - Sara Tfaili; Abdelkader Sbihi; Adnan Yassine; Ibrahima Diarrassouba (ICORES (Selected Papers), 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)

A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem. - Ibrahima Diarrassouba; Mohamed Khalil Labidi; Ali Ridha Mahjoub (Electron. Notes Discret. Math., 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 parallel hybrid optimization algorithm for some network design problems. - Ibrahima Diarrassouba; Mohamed Khalil Labidi; Ali Ridha Mahjoub (Soft Comput., 2019)

A Polyhedral Study for the Buy-at-Bulk Facility Location Problem. - Chaghoub Soraya; Ibrahima Diarrassouba (ISCO, 2020)

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)

The Constrained-Routing and Spectrum Assignment Problem: Extended Formulation and Branch-and-Cut-and-Price Algorithm. - Ibrahima Diarrassouba; Youssouf Hadhbi; Ali Ridha Mahjoub (CoDIT, 2022)

The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm. - Ibrahima Diarrassouba; Youssouf Hadhbi (ISCO, 2022)

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., 2023)

Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem. - Ibrahima Diarrassouba; Youssouf Hadhbi; Ali Ridha Mahjoub (J. Comb. Optim., 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., 2024)

Extended formulation and Branch-and-Cut-and-Price algorithm for the two connected subgraph problem with disjunctive constraints. - Fatmah Almathkour; Ibrahima Diarrassouba; Youssouf Hadhbi (Ann. Oper. Res., 2025)