Search Results - "Taktak, Raouia"

A Branch-and-Cut algorithm for the multiple Steiner TSP with order constraints by Taktak, Raouia

Get full text

Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut by Almudahka, Intesar, Diarrassouba, Ibrahima, Mahjoub, A. Ridha, Taktak, Raouia

“…In this paper we consider the two-edge-connected subgraph problem with disjunctive constraints. We investigate the convex hull of the solutions to this…”
Get full text

An overview on mathematical programming approaches for the deterministic unit commitment problem in hydro valleys by Taktak, Raouia, D’Ambrosio, Claudia

“…With the fast-growing demand in the electricity market of the last decades, attention has been focused on alternative and flexible sources of energy such as…”
Get full text

The Multiple Steiner TSP with order constraints: complexity and optimization algorithms by Gabrel, Virginie, Mahjoub, A. Ridha, Taktak, Raouia, Uchoa, Eduardo

“…We consider a variant of the Travelling Salesman Problem (TSP), the Multiple Steiner TSP with Order constraints (MSTSPO). Consider a weighted undirected graph…”
Get full text

Design of survivable networks with low connectivity requirements by Almathkour, Fatmah, Magnouche, Youcef, Mahjoub, A. Ridha, Taktak, Raouia

“…In this paper, we consider the survivable network design problem when the connectivity types are in {0, 1, 2, 3}. The problem has wide applications in…”
Get full text

Energy-Aware Routing in Carrier-Grade Ethernet Using SDN Approach by Maaloul, Rihab, Taktak, Raouia, Chaari, Lamia, Cousin, Bernard

“…Soft-defined networking (SDN) is a new approach that enables operators to easily manage all the network elements. In this paper, we address the problem of…”
Get full text

Optimization algorithms for the disjunctively constrained knapsack problem by Ben Salem, Mariem, Taktak, Raouia, Mahjoub, A. Ridha, Ben-Abdallah, Hanêne

“…This paper deals with the Knapsack Problem with conflicts, also known as the Disjunctively Constrained Knapsack Problem. The conflicts are represented by a…”
Get full text

Shortest Path Problem variants for the Hydro Unit Commitment Problem by van Ackooij, Wim, D'Ambrosio, Claudia, Liberti, Leo, Taktak, Raouia, Thomopulos, Dimitri, Toubaline, Sonia

“…In this paper, we study the deterministic single-reservoir Hydro Unit Commitment Problem. Under some hypotheses, we present a time expanded graph…”
Get full text

The k-node connected subgraph problem: Polyhedral analysis and Branch-and-Cut by Diarrassouba, Ibrahima, Mahjoub, Meriem, Mahjoub, A. Ridha, Taktak, Raouia

“…In this paper we consider the k-node connected subgraph problem. We propose an integer linear programming formulation for the problem and investigate the…”
Get full text

The Labeled Two Edge Connected Subgraph Problem by Ben Salem, Mariem, Taktak, Raouia

“…In this paper, we address a variant of the Two Edge Connected Problem (TECP), that is the TECP with color constraint on the edges, also known as the Labeled…”
Get full text

A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints by Borne, S., Mahjoub, A.R., Taktak, R.

“…The paper deals with a problem motivated by survivability issues in multilayer IP-over-WDM telecommunication networks. Given a set of traffic demands for which…”
Get full text

A layered compact formulation for the Multiple Steiner TSP with Order constraints by Mahjoub, A. Ridha, Taktak, Raouia, Uchoa, Eduardo

“…In this paper we study a network design problem that consists in finding a minimum weight subgraph containing solutions for multiple Steiner Traveling Salesman…”
Get full text

Inter-slice B5G Bandwidth Resource Allocation by Debbabi, Fadoua, Taktak, Raouia, Jmal, Rihab, Fourati, Lamia Chaari, Luis Aguiar, Rui

“…The Beyond 5G (B5G) networks vision afford wireless access to a vertical market with varying Quality of Service (QoS) requirements. Network Slicing (NS) is one…”
Get full text

A special case of Variable-Sized Bin Packing Problem with Color Constraints by Crevits, Igor, Hanafi, Said, Mahjoub, A. Ridha, Taktak, Raouia, Wilbaut, Christophe

“…The Variable-Sized Bin Packing Problem with Color Constraints (VSBPP-CC) is a generalization of the classical one-dimensional Bin Packing Problem, where bins…”
Get full text

Equal Cost Multiple Path Energy-Aware Routing in Carrier-Ethernet Networks with Bundled Links by Maaloul, Rihab, Taktak, Raouia, Chaari, Lamia, Cousin, Bernard

“…The reduction of operational expenditure has become a major concern for telecommunication operators and Internet service providers. In this paper, we propose…”
Get full text

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability by Maaloul, Rihab, Taktak, Raouia, Chaari, Lamia, Cousin, Bernard

“…Carrier grade networks are in general over-dimensioned in order to protect against network resource failures and to handle probable traffic peaks. Such network…”
Get full text

Polyhedral analysis for the disjunctively constrained Knapsack Problem by Ben Salem, Mariem, Taktak, Raouia, Ben Abdallah, Hanene, Mahjoub, A. Ridha

“…The paper deals with the Knapsack Problem with conflicts, also known as the Disjunctively Constrained Knapsack Problem (DCKP). The conflicts are represented by…”
Get full text