default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaouia Taktak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j11]Fatmah Almathkour
, Youcef Magnouche, Ali Ridha Mahjoub, Raouia Taktak:
Design of survivable networks with low connectivity requirements. Int. Trans. Oper. Res. 32(2): 918-960 (2025)- 2024
- [c11]Fadoua Debbabi, Rihab Jmal, Lamia Chaari Fourati, Raouia Taktak, Rui Luis Andrade Aguiar:
Adaptive Admission Control for 6G Network Slicing Resource Allocation (A2C-NSRA). AINA (1) 2024: 239-250 - 2023
- [j10]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: 109585 (2023) - 2022
- [j9]Mariem Ben Salem, Raouia Taktak, Fatmah Almathkour:
The edge-labeled survivable network design problem: Formulations and branch-and-cut. RAIRO Oper. Res. 56(5): 3393-3404 (2022) - [c10]Mariem Ben Salem, Raouia Taktak:
The Labeled Two Edge Connected Subgraph Problem. CoDIT 2022: 1020-1025 - [c9]Fadoua Debbabi, Raouia Taktak, Rihab Jmal, Lamia Chaari Fourati, Rui L. Aguiar:
Inter-slice B5G Bandwidth Resource Allocation. NCA 2022: 157-163 - 2020
- [j8]Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa:
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms. Soft Comput. 24(23): 17957-17968 (2020) - [c8]Raouia Taktak, Eduardo Uchoa:
On the Multiple Steiner Traveling Salesman Problem with Order Constraints. ISCO 2020: 66-77
2010 – 2019
- 2019
- [c7]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: 1150-1154 - [c6]Ali Ridha Mahjoub, Raouia Taktak, Eduardo Uchoa:
A layered compact formulation for the Multiple Steiner TSP with Order constraints. CoDIT 2019: 1462-1467 - [c5]Imene Ouali, Faiza Ghozzi, Raouia Taktak, Mohamed Saifeddine Hadj Sassi:
Ontology Alignment using Stable Matching. KES 2019: 746-755 - 2018
- [j7]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: 309-316 (2018) - [j6]Mariem Ben Salem, Raouia Taktak, Ali Ridha Mahjoub, Hanêne Ben-Abdallah:
Optimization algorithms for the disjunctively constrained knapsack problem. Soft Comput. 22(6): 2025-2043 (2018) - [j5]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): 844-858 (2018) - [c4]Rihab Maaloul, Raouia Taktak, Lamia Chaari, Bernard Cousin:
Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability. ICT 2018: 554-560 - 2017
- [j4]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: 690-705 (2017) - [j3]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): 627-637 (2017) - [c3]Rihab Maaloul, Raouia Taktak, Lamia Chaari, Bernard Cousin:
Equal Cost Multiple Path Energy-Aware Routing in Carrier-Ethernet Networks with Bundled Links. AICCSA 2017: 1101-1108 - 2016
- [j2]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: 117-124 (2016) - [c2]Mariem Ben Salem, Raouia Taktak, Hanêne Ben-Abdallah, Ali Ridha Mahjoub:
Polyhedral analysis for the disjunctively constrained Knapsack Problem. CoDIT 2016: 557-562 - 2013
- [b1]Raouia Taktak:
Survavibility in Multilayer Networks : models and Polyhedra. (Sécurisation de réseaux multicouches : modèles et polyèdres). Paris Dauphine University, France, 2013 - [j1]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: 487-494 (2013) - 2011
- [c1]Sylvie Borne, Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak:
Multilayer Survivable Optical Network Design. INOC 2011: 170-175
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
