|
|
Exact and heuristic methods for the vertex separator problem
Haeder Althoby
,
Mohamed Didi Biha
,
André Sesboüé
Article dans une revue
hal-02427906v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
An exact algorithm for solving the vertex separator problem
Mohamed Didi Biha
,
Marie-Jean Meurs
Article dans une revue
istex
hal-01318627v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Exact and heuristic methods for the vertex separator problem
Haeder y Althoby
,
Mohamed Didi Biha
,
André Sesboüé
2019
Pré-publication, Document de travail
hal-02156556v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Graph Decomposition Approaches for Terminology Graphs
Mohamed Didi Biha
,
Bangaly Kaba
,
Marie-Jean Meurs
,
Eric Sanjuan
6th Mexican International Conference on Artificial Intelligence, Nov 2007, Aguascalientes, Mexico
Communication dans un congrès
hal-01318619v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
The cut separator problem
Walid Ben-Ameur
,
Mohamed Didi Biha
INOC 2009 : International Network Optimization Conference, Apr 2009, Pisa, Italy. pp.1 - 5
Communication dans un congrès
hal-01367479v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Extended cuts
Walid Ben-Ameur
,
Mohamed Didi Biha
Article dans une revue
hal-01449794v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Algorithms and formulations for the minimum cut separator problem
Walid Ben-Ameur
,
Mohamed Didi Biha
Article dans une revue
istex
hal-00528560v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut
Fatiha Bendali
,
Ibrahima Diarrassouba
,
Mohamed Didi Biha
,
Ali Ridha Mahjoub
,
Jean Mailfert
International Workshop on Design of Reliable Communication Networks (DRCN), Oct 2007, La Rochelle, France. pp.Pages 1 - 8, ⟨10.1109/DRCN.2007.4762290⟩
Communication dans un congrès
hal-00678058v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Models and methods for frequency assignment with cumulative interference constraints
Mireille Palpant
,
Cristian Oliva
,
Christian Artigues
,
Philippe Michelon
,
Mohamed Didi Biha
Article dans une revue
hal-00116624v2
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
On the minimum cut separator problem
Walid Ben-Ameur
,
Mohamed Didi Biha
Article dans une revue
istex
hal-00679174v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
Polyhedral study of the connected subgraph problem
Mohamed Didi Biha
,
Hervé L.M. Kerivin
,
Peh Ng
Article dans une revue
hal-02145375v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
A branch-and-cut algorithm for the k-edge connected subgraph problem
Fatiha Bendali
,
Ibrahima Diarrassouba
,
Ali Ridha Mahjoub
,
Mohamed Didi Biha
,
Jean Mailfert
Article dans une revue
istex
hal-00972575v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|
|
|
A note on the problem of r disjoint (s,t)-cuts and some related issues
Walid Ben-Ameur
,
Mohamed Didi Biha
Article dans une revue
hal-01783782v1
|
Partager
Gmail
Facebook
X
LinkedIn
More
|