Raouia Taktak

Orcid: 0000-0003-2377-5709

According to our database1, Raouia Taktak authored at least 22 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Adaptive Admission Control for 6G Network Slicing Resource Allocation (A2C-NSRA).
Proceedings of the Advanced Information Networking and Applications, 2024

2023
Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut.
Comput. Ind. Eng., October, 2023

2022
The edge-labeled survivable network design problem: Formulations and branch-and-cut.
RAIRO Oper. Res., September, 2022

Inter-slice B5G Bandwidth Resource Allocation.
Proceedings of the 21st IEEE International Symposium on Network Computing and Applications, 2022

The Labeled Two Edge Connected Subgraph Problem.
Proceedings of the 8th International Conference on Control, 2022

2020
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms.
Soft Comput., 2020

On the Multiple Steiner Traveling Salesman Problem with Order Constraints.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019
Ontology Alignment using Stable Matching.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 23rd International Conference KES-2019, 2019

A layered compact formulation for the Multiple Steiner TSP with Order constraints.
Proceedings of the 6th International Conference on Control, 2019

A special case of Variable-Sized Bin Packing Problem with Color Constraints.
Proceedings of the 6th International Conference on Control, 2019

2018
Energy-Aware Routing in Carrier-Grade Ethernet Using SDN Approach.
IEEE Trans. Green Commun. Netw., 2018

Optimization algorithms for the disjunctively constrained knapsack problem.
Soft Comput., 2018

Shortest Path Problem variants for the Hydro Unit Commitment Problem.
Electron. Notes Discret. Math., 2018

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability.
Proceedings of the 25th International Conference on Telecommunications, 2018

2017
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem.
RAIRO Oper. Res., 2017

The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut.
Comput. Ind. Eng., 2017

Equal Cost Multiple Path Energy-Aware Routing in Carrier-Ethernet Networks with Bundled Links.
Proceedings of the 14th IEEE/ACS International Conference on Computer Systems and Applications, 2017

2016
The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut.
Electron. Notes Discret. Math., 2016

Polyhedral analysis for the disjunctively constrained Knapsack Problem.
Proceedings of the International Conference on Control, 2016

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

A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints.
Electron. Notes Discret. Math., 2013

2011
Multilayer Survivable Optical Network Design.
Proceedings of the Network Optimization - 5th International Conference, 2011


  Loading...