(Dans toutes les publications, c'est l'ordre alphabétique
des auteurs qui est considéré.)
Rapports de recherche
-
S. Borne, E. Gourdin, O. Klopfenstein and A. R.
Mahjoub, “The Multilayer Capacitated Survivable IP Network
Design Problem: Valid Inequalities and Branch-and-Cut”. Soumis à
Network.
- H. L. M. Kerivin, M. Lacroix, A. R. Mahjoub, “On the
complexity of the Eulerian closed walk with precedence path
constraints problem”, soumis à SIAM Journal on Computing.
- M. Lacroix, A. R.
Mahjoub, S. Martin and Ch. Picouleau,
“On the NP-completeness of the Perfect Matching Free Subgraph
problem”, soumis à
Information Processing Letters.
- A. R. Mahjoub and L. Slama, “On the polytope of the
(1,k)-survivable network design problem”, soumis à Journal of
Combinatorial Optimization.
- D. Cornaz, H. Kerivin and A. R. Mahjoub, “The induced
forest and acyclic subgraph problems”, soumis à SIAM Journal on Discrete Mathematics.
