Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

13 résultats
Page :
triés par
Image document

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

An exact algorithm for solving the vertex separator problem

 Mohamed Didi Biha , Marie-Jean Meurs
Journal of Global Optimization, 2011, ⟨10.1007/s10898-010-9568-y⟩
Article dans une revue istex hal-01318627v1
Image document

Exact and heuristic methods for the vertex separator problem

 Haeder Althoby , Mohamed Didi Biha , André Sesboüé
Computers & Industrial Engineering, 2020, 139, pp.106135. ⟨10.1016/j.cie.2019.106135⟩
Article dans une revue hal-02427906v1

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

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

Extended cuts

 Walid Ben-Ameur , Mohamed Didi Biha
Journal of Combinatorial Optimization, 2016, 31 (3), pp.1034 - 1044. ⟨10.1007/s10878-014-9808-z⟩
Article dans une revue hal-01449794v1

Algorithms and formulations for the minimum cut separator problem

 Walid Ben-Ameur , Mohamed Didi Biha
Electronic Notes in Discrete Mathematics, 2010, 36 (1), pp.977-983. ⟨10.1016/j.endm.2010.05.124⟩
Article dans une revue istex hal-00528560v1

A note on the problem of r disjoint (s,t)-cuts and some related issues

 Walid Ben-Ameur , Mohamed Didi Biha
Operations Research Letters, 2018, 46, pp.335 - 338. ⟨10.1016/j.orl.2018.03.003⟩
Article dans une revue hal-01783782v1

A branch-and-cut algorithm for the k-edge connected subgraph problem

 Fatiha Bendali , Ibrahima Diarrassouba , Ali Ridha Mahjoub , Mohamed Didi Biha , Jean Mailfert
Networks, 2009, 55 (1), pp.13-32. ⟨10.1002/net.20310⟩
Article dans une revue istex hal-00972575v1
Image document

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
Image document

Models and methods for frequency assignment with cumulative interference constraints

 Mireille Palpant , Cristian Oliva , Christian Artigues , Philippe Michelon , Mohamed Didi Biha
International Transactions in Operational Research, 2008, 15 (3), pp.307-324. ⟨10.1111/j.1475-3995.2008.00630.x⟩
Article dans une revue hal-00116624v2

Polyhedral study of the connected subgraph problem

 Mohamed Didi Biha , Hervé L.M. Kerivin , Peh Ng
Discrete Mathematics, 2015, 338 (1), pp.80-92. ⟨10.1016/j.disc.2014.08.026⟩
Article dans une revue hal-02145375v1

On the minimum cut separator problem

 Walid Ben-Ameur , Mohamed Didi Biha
Networks, 2012, 59 (1), pp.30-36. ⟨10.1002/net.20478⟩
Article dans une revue istex hal-00679174v1
Page :