Meriem Mahjoub - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 5 from 5

2018

k-node-disjoint hop-constrained survivable networks: polyhedral analysis and branch and cutIbrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Hande Yaman. adt, 73(1-2):5-28, 2018. [doi]

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, PSL Research University, Paris, France, 2017. [doi]

The survivable k-node-connected network design problem: Valid inequalities and Branch-and-CutMeriem Mahjoub, I. Diarrassouba, Ali Ridha Mahjoub, Raouia Taktak. candie, 112:690-705, 2017. [doi]

2016

The k-node-connected subgraph problem: Facets and Branch-and-CutIbrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub. drcn 2016: 1-8 [doi]

The k-node connected subgraph problem: Polyhedral analysis and Branch-and-CutIbrahima Diarrassouba, Meriem Mahjoub, Ali Ridha Mahjoub, Raouia Taktak. endm, 52:117-124, 2016. [doi]

Sign in or sign up to see more results.

runs on WebDSL