Publications

(Dans toutes les publications, c'est l'ordre alphabétique des auteurs qui est considéré.)

Articles parus dans des proceedings

• A. R. Mahjoub, M. Y. Naghmouchi, N. Perrot , “A Bi-Level Programming Model for Proactive Countermeasure Selection in Complex ICT Systems” , INOC 2017, Electronic Notes in Discrete Mathematics 64, pp. 295-304 (2018) .  PDF

• I. Diarrassouba, M. K. Labidi, A. R. Mahjoub , “A Hybrid Optimization Approach For the Steiner k-Connected Network Design Problem” , INOC 2017, Electronic Notes in Discrete Mathematics 64, pp. 305-314 (2018) .  PDF

• I. Diarrassouba, A. R. Mahjoub, P. H. Liguori , “The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut” , INOC 2017, Electronic Notes in Discrete Mathematics 64, pp. 315-324 (2018) .  PDF

• H. Aissi, A. R. Mahjoub, R. Ravi , “Randomized Contractions for Multiobjective Minimum Cuts” , ESA 2017, pp. 1-6 (2017) .  PDF

• I. Diarrassouba, M. Mahjoub, A. R. Mahjoub , “The k-Node Connected Subgraph Problem: Facets and Branch-and-Cut” , DRCN 2016, pp. 1-8 (2016) .  PDF

• I. Diarrassouba, M. Mahjoub, A. R. Mahjoub, R. Taktak , “The k-connected subgraph problem : Polyhedral analysis and Branch-and-Cut” , INOC 2015, Electronic Notes in Discrete Mathematics 52, pp. 117-124 (2016) .  PDF

• I. Diarrassouba, M. Mahjoub, A. R. Mahjoub , “The k-node connected subgraph proble: Formulation, polyhedral analysis and branch-and-cut” , Proceedings of CIE 45, Metz (France), pp. 841-848 (2015) (Ce papier a gagné le prix du meilleur papier étudiant dans la conférence) .  PDF

• D. Cornaz, Y. Magnouche, A. R. Mahjoub, S. Martin , “The multi-terminal vertex separator problem : Polyhedral analysis and branch-and-cut” , Proceedings of CIE 45, Metz (France), pp. 857-864 (2015) .  PDF

• N. Fofack, A. R. Mahjoub, M. Y. Naghmouchi, N. Perrot , “Energy saving in content-oriented networks” , Proceedings of CIE 45, Metz (France), pp. 849-856 (2015) .  PDF

• D. Cornaz, F. Furini, M. Lacrois, E. Malaguti, A. R. Mahjoub, S. Martin , “Mathematical formulations for the balanced k-separator problem” , CoDIT 14, IEEE, pp. 176-181 (2014) .  PDF

• L. Aoudia, A. R. Mahjoub, V. H. Nguyen , “On the star forest polytope” , CoDIT 14, IEEE, pp. 263-268 (2014) .  PDF

• H. Aissi, A. R. Mahjoub, S. Th. McCormick and M. Queyranne , “A strongly polynomial time algorithm for multicriteria global minimum cuts” , IPCO 2014, Lectures Notes in Computer Sciences 8494, pp. 25-36 (2014) .

• S. Borne, A. R. Mahjoub, R. Taktak , “A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints” , INOC 2013, Electronic Notes in Discrete Mathematics 41, pp. 487-494 (2013) .  PDF

• A. Benhamiche, A. R. Mahjoub, N. Perrot, E. Uchoa , “Capacitated Network Design using Bin-Packing” , INOC 2013, Electronic Notes in Discrete Mathematics 41, pp. 479-486 (2013) .  PDF

• I. Diarrassouba, H. Kutucu, A. R. Mahjoub , “Two Node-Disjoint 3-Hop-Constrained Survivable Network Design Polyhedra” , INOC 2013, Electronic Notes in Discrete Mathematics 41, pp. 551-558 (2013) .  PDF

• Mathieu Lacroix, A. Ridha Mahjoub and Sebastien Martin, “Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem”, ISCO 2012, LNCS 7422, pp.117-128, Springer, Heidelberg (2012).  PDF
  
  
  
• Amal Benhamiche, Ali Ridha mahjoub, Nancy Perrot, “On the Design of Optical OFDM-Based Networks”, Proceedings INOC 2011, LNCS 6701, (2011) pp.1-6.

• Sylvie Borne, Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak, “Multilayer Survivable Optical Network Design”, Proceedings of INOC 2011, LNCS 6701, (2011) pp.170-175.

• Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa, “Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem”, Proceedings of INOC 2011, LNCS 6701, (2011) pp.176-181.  PDF

• Boulbaba Thabti, Aref Meddeb, A. Ridha Mahjoub, Habib Youssef, “Evolutionary algorithm for provisioning VPN trees based on pipe and hose workload models”, Proceedings of ICNC 2011, (2011) pp.2058-2064.  PDF

• M. Lacroix, A. R. Mahjoub and S. Martin, “Structural Analysis in Diffirential-Algebraic Systems: Complexity, Formulations and Facets”, Electronic Notes on Discrete Mathematics, Proceedings of ISCO 2010, Vol. 36 (2010) pp. 1073-1080.   PDF

•   H. Kerivin, M. Lacroix and A. R. Mahjoub, “On the complexity of the Eulerian closed walk with precedence path constraints problem”, Proceeding of ISCO 2010,  Electronic Notes on Discrete Mathematics Vol. 36 (2010), pp. 899-906.  PDF

• A. Benhamiche, A. R. Mahjoub and N. Perrot, “Design of Optical WDM Networks”, Proceedings of the IEEE Conference NETWORKS 2010, (September 2010), Warsaw, Poland, pp. 47-53.

• M. Lacroix, A. R. Mahjoub and S. Martin, “Structural Analysis in Diffirential-Algebraic Systems and Combinatorial Optimization”, IEEE Computers and Industrial Engineering, Proceedings of CIE 39, (July 2009), Troyes, (France). pp. 331-337. (Ce papier a gagné le prix du best student paper dans la conference.)  PDF

•   S. Borne, E. Gourdin, O. Klopfenstein and A. R. Mahjoub, “The multilayer capacitated survivable IP network design problem”, Proceedings of the INOC 2009 (April 2009), Pisa, (Italy).

• O. Ekin-Karazan, P. Fouilhoux, A. R. Mahjoub, O. özkök, H. Yaman, "Survivability in hierarchical telecommunication networks", Proceedings of the INOC 2009 (April 2009), Pisa, (Italy).

•  F. Bendali, I. Diarrassouba, M. Didi Biha, A. R. Mahjoub, J. Mailfert, “ The k-edge connected subgraph problem : Valid inequalities and Branch-and-Cut", Proceedings of the 6th International Workshop on the Design of Reliable Communication Networks 07, (Octobre 2007), La Rochelle (France).  PDF

• H. Kerivin, M. Lacroix, A. R. Mahjoub, A. Quilliot, "The capacitated vehicle routing problem with reloads", Proceedings of the IEEE Conference IC SSSM’06, (Octobre 2006), Troyes (France), pp. 1513 - 1518.  PDF

• F. Bendali, I. Diarrassouba, M. Didi Biha, A. R. Mahjoub, J. Mailfert, “Un algorithme de coupes et branchements pour le problème du sous graphe k-arête connexe”, ValenSciences N#5, Actes des articles longs sélectionnés du 7ème Congrès de la ROADEF, (Février 2006), Lille (France), pp. 57-78. Résumé  PDF

• D. Huygens, M. Labbé, A.R. Mahjoub and P.Pesneau, “Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut”, Proceedings INOC 2005, (Mars 2005), pp. 581-586.

• M. Didi Biha, A. R. Mahjoub and L. Slama, “On the separation of partition inequalities”, Proceedings INOC2005, (Mars 2005), pp. 500-505. Résumé

• P. Fouilhoux et A. R. Mahjoub, “Sous graphe k-partis induits et applications à la génomique et aux circuits VLSI“, Collection Sciences, Technologie à Informatique N# 1, Actes des articles longs sélectionnés du 6ème Congrès de la ROADEF, (Février 2005), Tours (France), pp. 83-98.

• S. Borne, E. Gourdin, B. Liau and A. R. Mahjoub, “Design of Survivable IP-over-Optical Networks“, Proceedings INOC2003, (Octobre 2003), Evry (France), pp. 114-118. Résumé

• J. Fonlupt and A.R. Mahjoub, "Critical extreme points of the 2-edge connected spanning subgraph polytope" IPCO'99, Lecture Notes in Computer Sciences (1999) 1610, pp. 166-183.

• M. Didi Biha, H. Kerivin and A.R. Mahjoub "Une approche polyèdrale pour le problème de l'arbre Steiner", Actes des sixièmes journées du groupe MODE (Mars 1998) Poitiers (France) pp. 86-91.

• M. Daoud, A.R. Mahjoub, M. Tanguy, "Techniques de Flots et comparaison d'images en 2D", Proceedings 16 ème Colloque GRETSI, (Septembre 1997), Grenoble (France) pp. 853-856.  PDF

• F. Barahona and A.R. Mahjoub, "On two connected subgraph polytopes" Proceedings IPCO Conference, (1992), Pittsburg (USA), pp. 30-43.