Multilayer Survivable Optical Network Design. - Sylvie Borne; Virginie Gabrel; Ali Ridha Mahjoub; Raouia Taktak (INOC, 2011)

A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints. - Sylvie Borne; Ali Ridha Mahjoub; Raouia Taktak (Electron. Notes Discret. Math., 2013)

Survavibility in Multilayer Networks : models and Polyhedra. (Sécurisation de réseaux multicouches : modèles et polyèdres). - Raouia Taktak (2013)

Polyhedral analysis for the disjunctively constrained Knapsack Problem. - Mariem Ben Salem; Raouia Taktak; Hanêne Ben-Abdallah; Ali Ridha Mahjoub (CoDIT, 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)

Equal Cost Multiple Path Energy-Aware Routing in Carrier-Ethernet Networks with Bundled Links. - Rihab Maaloul; Raouia Taktak; Lamia Chaari; Bernard Cousin (AICCSA, 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)

Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem. - Mariem Ben Salem; Saïd Hanafi; Raouia Taktak; Hanêne Ben-Abdallah (RAIRO Oper. Res., 2017)

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability. - Rihab Maaloul; Raouia Taktak; Lamia Chaari; Bernard Cousin (ICT, 2018)

Shortest Path Problem variants for the Hydro Unit Commitment Problem. - Wim van Ackooij; Claudia D'Ambrosio; Leo Liberti; Raouia Taktak; Dimitri Thomopulos; Sonia Toubaline (Electron. Notes Discret. Math., 2018)

Optimization algorithms for the disjunctively constrained knapsack problem. - Mariem Ben Salem; Raouia Taktak; Ali Ridha Mahjoub; Hanêne Ben-Abdallah (Soft Comput., 2018)

Energy-Aware Routing in Carrier-Grade Ethernet Using SDN Approach. - Rihab Maaloul; Raouia Taktak; Lamia Chaari; Bernard Cousin (IEEE Trans. Green Commun. Netw., 2018)

A special case of Variable-Sized Bin Packing Problem with Color Constraints. - Igor Crévits; Saïd Hanafi; Ali Ridha Mahjoub; Raouia Taktak; Christophe Wilbaut (CoDIT, 2019)

A layered compact formulation for the Multiple Steiner TSP with Order constraints. - Ali Ridha Mahjoub; Raouia Taktak; Eduardo Uchoa (CoDIT, 2019)

Ontology Alignment using Stable Matching. - Imene Ouali; Faiza Ghozzi; Raouia Taktak; Mohamed Saifeddine Hadj Sassi (KES, 2019)

On the Multiple Steiner Traveling Salesman Problem with Order Constraints. - Raouia Taktak; Eduardo Uchoa (ISCO, 2020)

The Multiple Steiner TSP with order constraints: complexity and optimization algorithms. - Virginie Gabrel; Ali Ridha Mahjoub; Raouia Taktak; Eduardo Uchoa (Soft Comput., 2020)

The Labeled Two Edge Connected Subgraph Problem. - Mariem Ben Salem; Raouia Taktak (CoDIT, 2022)

Inter-slice B5G Bandwidth Resource Allocation. - Fadoua Debbabi; Raouia Taktak; Rihab Jmal; Lamia Chaari Fourati; Rui L. Aguiar (NCA, 2022)

The edge-labeled survivable network design problem: Formulations and branch-and-cut. - Mariem Ben Salem; Raouia Taktak; Fatmah Almathkour (RAIRO Oper. Res., 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)

Adaptive Admission Control for 6G Network Slicing Resource Allocation (A2C-NSRA). - Fadoua Debbabi; Rihab Jmal; Lamia Chaari Fourati; Raouia Taktak; Rui Luis Andrade Aguiar (AINA (1), 2024)

Optimal Covering and Trajectory Planning for Air-Ground Integrated Networks in Post-Disaster Scenarios. - Khouloud Kessentini; Raouia Taktak; Lamia Chaari (ICORES, 2025)

Design of survivable networks with low connectivity requirements. - Fatmah Almathkour; Youcef Magnouche; Ali Ridha Mahjoub; Raouia Taktak (Int. Trans. Oper. Res., 2025)

The multiple steiner TSP with cyclic order on terminals: valid inequalities and polyhedra. - Ali Ridha Mahjoub; Raouia Taktak; Eduardo Uchoa (J. Comb. Optim., 2025)

A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints. - Raouia Taktak (Ann. Oper. Res., 2025)