Mohamed Didi Biha

Publication Activity (10 Years)

Years Active: 1996-2020
Publications (10 Years): 3

Top Topics

Heuristic Methods

Top Venues

Oper. Res. Lett.

J. Comb. Optim.

Comput. Ind. Eng.

Publications

Haeder Y. Althoby, Mohamed Didi Biha, André Sesboüé
Exact and heuristic methods for the vertex separator problem. Comput. Ind. Eng. 139 (2020)
Walid Ben-Ameur, Mohamed Didi Biha
A note on the problem of r disjoint (s, t)-cuts and some related issues. Oper. Res. Lett. 46 (3) (2018)
Walid Ben-Ameur, Mohamed Didi Biha
Extended cuts. J. Comb. Optim. 31 (3) (2016)
Mohamed Didi Biha, Hervé L. M. Kerivin, Peh H. Ng
Polyhedral study of the connected subgraph problem. Discret. Math. 338 (1) (2015)
Walid Ben-Ameur, Mohamed Didi Biha
On the minimum cut separator problem. Networks 59 (1) (2012)
Mohamed Didi Biha, Marie-Jean Meurs
An exact algorithm for solving the vertex separator problem. J. Glob. Optim. 49 (3) (2011)
Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Mohamed Didi Biha, Jean Mailfert
-edge connected subgraph problem. Networks 55 (1) (2010)
Walid Ben-Ameur, Mohamed Didi Biha
Algorithms and formulations for the minimum cut separator problem. Electron. Notes Discret. Math. 36 (2010)
Mireille Palpant, Cristian Oliva, Christian Artigues, Philippe Michelon, Mohamed Didi Biha
Models and methods for frequency assignment with cumulative interference constraints. Int. Trans. Oper. Res. 15 (3) (2008)
Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
On the Polytope of the (1, 2)-Survivable Network Design Problem. SIAM J. Discret. Math. 22 (4) (2008)
Mohamed Didi Biha, Bangaly Kaba, Marie-Jean Meurs, Eric SanJuan
Graph Decomposition Approaches for Terminology Graphs. MICAI (2007)
Fatiha Bendali, Ibrahima Diarrassouba, Mohamed Didi Biha, Ali Ridha Mahjoub, Jean Mailfert
The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut. DRCN (2007)
Mohamed Didi Biha
On the 3-Terminal Cut Polyhedron. SIAM J. Discret. Math. 19 (3) (2005)
Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
Steiner trees and polyhedra. Discret. Appl. Math. 112 (1-3) (2001)
Mohamed Didi Biha, Ali Ridha Mahjoub
Steiner k-Edge Connected Subgraph Polyhedra. J. Comb. Optim. 4 (1) (2000)
Mohamed Didi Biha, Ali Rhida Mahjoub
k-edge connected polyhedra on series-parallel graphs. Oper. Res. Lett. 19 (2) (1996)