Raouia Taktak

ORCID

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 18

Top Venues

CoDIT

Electron. Notes Discret. Math.

Soft Comput.

RAIRO Oper. Res.

Paris Dauphine University, France (PHD)

Education History

Paris Dauphine University, France

PHD

Publications

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)
Mariem Ben Salem, Raouia Taktak, Fatmah Almathkour
The edge-labeled survivable network design problem: Formulations and branch-and-cut. RAIRO Oper. Res. 56 (5) (2022)
Fadoua Debbabi, Raouia Taktak, Rihab Jmal, Lamia Chaari Fourati, Rui L. Aguiar
Inter-slice B5G Bandwidth Resource Allocation. NCA (2022)
Mariem Ben Salem, Raouia Taktak
The Labeled Two Edge Connected Subgraph Problem. CoDIT (2022)
Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms. Soft Comput. 24 (23) (2020)
Raouia Taktak, Eduardo Uchoa
On the Multiple Steiner Traveling Salesman Problem with Order Constraints. ISCO (2020)
Imene Ouali, Faiza Ghozzi, Raouia Taktak, Mohamed Saifeddine Hadj Sassi
Ontology Alignment using Stable Matching. KES (2019)
Igor Crévits, Saïd Hanafi, Ali Ridha Mahjoub, Raouia Taktak, Christophe Wilbaut
A special case of Variable-Sized Bin Packing Problem with Color Constraints. CoDIT (2019)
Ali Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa
A layered compact formulation for the Multiple Steiner TSP with Order constraints. CoDIT (2019)
Rihab Maaloul, Raouia Taktak, Lamia Chaari, Bernard Cousin
Energy-Aware Routing in Carrier-Grade Ethernet Using SDN Approach. IEEE Trans. Green Commun. Netw. 2 (3) (2018)
Wim van Ackooij, Claudia D'Ambrosio, Leo Liberti, Raouia Taktak, Dimitri Thomopulos, Sonia Toubaline
Shortest Path Problem variants for the Hydro Unit Commitment Problem. Electron. Notes Discret. Math. 69 (2018)
Rihab Maaloul, Raouia Taktak, Lamia Chaari, Bernard Cousin
Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability. ICT (2018)
Mariem Ben Salem, Raouia Taktak, Ali Ridha Mahjoub, Hanêne Ben-Abdallah
Optimization algorithms for the disjunctively constrained knapsack problem. Soft Comput. 22 (6) (2018)
Rihab Maaloul, Raouia Taktak, Lamia Chaari, Bernard Cousin
Equal Cost Multiple Path Energy-Aware Routing in Carrier-Ethernet Networks with Bundled Links. AICCSA (2017)
Mariem Ben Salem, Saïd Hanafi, Raouia Taktak, Hanêne Ben-Abdallah
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem. RAIRO Oper. Res. 51 (3) (2017)
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 (2017)
Mariem Ben Salem, Raouia Taktak, Hanêne Ben-Abdallah, Ali Ridha Mahjoub
Polyhedral analysis for the disjunctively constrained Knapsack Problem. CoDIT (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)
Sylvie Borne, Ali Ridha Mahjoub, Raouia Taktak
A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints. Electron. Notes Discret. Math. 41 (2013)
Sylvie Borne, Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak
Multilayer Survivable Optical Network Design. INOC (2011)

Raouia Taktak.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Raouia Taktak