Meriem Mahjoub

According to our database, Meriem Mahjoub authored at least 5 papers between 2016 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2018

k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cut.

Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Hande Yaman

Ann. des Télécommunications, 2018

2017

The Survivable Network Design Problems with High Node-Connectivity Constraints : Polyhedra and Algorithms. (Conception de réseaux fiables avec fortes contraintes de sommet-connexité : Étude polyédrale et Algorithmes).

Meriem Mahjoub

PhD thesis, 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

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

The k-node-connected subgraph problem: Facets and Branch-and-Cut.

Ibrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub

Proceedings of the 12th International Conference on the Design of Reliable Communication Networks, 2016