Publications

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

Articles parus (ou acceptés) dans des journaux spécialisés

• M. Baïou, L. Oudia, A. R. Mahjoub,V. H. Nguyen , “On the star forest polytope for trees and cycles” , RAIRO - OR (à paraître) .

• O. Arslan, O. Ekin Karasan, A. R. Mahjoub, H. Yaman , “A Branch-and-cut Algorithm for the Alternative Fuel Refueling Station Location Problem with Routing” , Transportation Science (à paraître) .

• D. Cornaz, F. Furini, M. Lacroix, E. Malaguti, A. R. Mahjoub, S. Martin , “The Vertex k-cut Problem” , Discrete Optimization (à paraître) .

• I. Diarrassouba, M. K. Labidi, A. R . Mahjoub , “A Parallel Hybrid Optimization Algorithm for some Network Design Problems” , Soft Computing 23 (6) (2019) pp. 1947-1964 .  PDF

• P. Fouilhoux, A. R. Mahjoub, A. Quilliot, H. Toussaint , “Branch-and-Cut-and-Price algorithms for the preemptive RCPSP” , RAIRO - OR 52-2 (2018) pp. 513-528 .  PDF

• S. Borne, E. Gourdin, O. Klopfenstein and A. R. Mahjoub , “The Multilayer Capacitated Survivable IP Network Design Problem: Valid Inequalities and Branch-and-Cut” , Computer & Industrial Engineering 124 (2018) pp. 582-603 .  PDF

• I. Diarrassouba, M. Mahjoub, A. R. Mahjoub, H. Yaman , “k-Node-Disjoint Hop-Constrained Survivable Networks: Polyhedral Analysis and Branch & Cut” , Annals of Telecommunication 73 (1-2) (2018) pp. 5-28 .  PDF

• N. Kheir, A. R. Mahjoub, M. Y. Nagmouchi, N. Pierrot, J.P. Wary , “Assessing the risk of complex ICT systems” , Annals of Telecommunication 73 (1-2) (2018) pp. 95-109 .  PDF

• D. Cornaz, H. Kerivin, A. R. Mahjoub , “Minimal arc-sets spanning dicycles” , Discrete Applied Mathemathematics 240 (2018) pp. 33-43 .  PDF

• M. Ben Salem, H. Ben Abdallah, R. Mahjoub, R. Taktak , “Optimization Algorithms for the Disjunctively Constrained Knapsack Problem” , Soft Computing 22 (6) (2018) pp. 2025-2043 .  PDF

• I. Diarrassouba, M. Mahjoub, A. R. Mahjoub, R. Taktak , “The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut” , Computers & Industrial Engineering 112 (2017) pp. 690-705 .  PDF

• A. Benhamiche, A. R. Mahjoub, N. Perrot, E. Uchoa , “Column generation based algorithms for the capacitated multi-layer network design with unsplittable demands” , Pesquisa Operacional 37 (3) (2017) pp. 1-26 .  PDF

• I. Diarrassouba, V. Gabrel, L. Gouveia, A. R. Mahjoub, P. Pesneau , “Integer programming formulations for the k-edge connected 3-hop constrained network design problem” , Networks 67 (2) (2016) pp. 148-169 .  PDF

• I. Diarrassouba, H. Kütücü, A. R. Mahjoub , “Two Node-Disjoint Hop-Constrained Survivable Network Design and Polyhedra” , Networks 67 (4) (2016) pp. 316-337 .  PDF

• A. Benhamiche, A. R. Mahjoub, N. Perrot, Eduardo Uchoa , “Unsplittable non-additive capacitated network design using set functions polyhedral” , Computer and Operations Research 66 (2016) pp. 105-115 .  PDF

• H. Aissi, A. R. Mahjoub, S. Th. McCormick, M. Queyranne , “A strongly polynomial time algorithm for multicriteria global minimum cuts” , Mathematical Programming 154 (1-2) (2015) pp. 3-28 .  PDF

• O. Ekin Karasan, A. R. Mahjoub, O. Özkök, H. Yaman , “Survivability in Hierarchical Telecommunications Networks under Dual Homing” , Informs Journal on Computing 26 (1) (2014) pp. 1-15 .  PDF

• I. Diarrassouba, A. Lourimi, A. R. Mahjoub, H. Youssef , “Hose workload based exact algorithm for the optimal design of virtual private networks” , Computer Networks 57 (14) (2013) pp. 2766-2774 .  PDF

• A. R. Mahjoub, L. Simonetti, E. Uchoa , “Hop-Level Flow Formulation for the Survivable Network Design with Hop Constraints Problem” , Networks 61 (2) (2013) pp. 171-179 .  PDF

• H. L. M. Kerivin, M. Lacroix, A. R. Mahjoub , “On the complexity of the Eulerian closed walk with precedence path constraints problem” , Theretical Computer Science, Vol 439 (2012) pp. 16-29 .  PDF

• P. Fouilhoux and A. R. Mahjoub , “Solving VLSI Design and DNA Sequencing Problems using Bipartization of Graphs” , Computational Optimization and Applications Vol 51 N#2 (2012) pp. 749-781 .  PDF

• M. Lacroix, A. R. Mahjoub, S. Martin and Ch. Picouleau, “On the NP-completeness of the Perfect Matching Free Subgraph problem”, Theoretical Computer Science Vol 423 (2012) pp. 25-29 .  PDF

• H. L. M. Kerivin, M. Lacroix, A. R. Mahjoub, "Models for the single-vehicle preemptive pickup and delivery problem", Journal of Combinatorial Optimization Vol 23 (2) (2012) pp. 196-223.  PDF

• P. Fouilhoux, O. Ekin Karasan, R. Mahjoub, O. özkök, H. Yaman, "Survivability in Hierarchical Telecommunication Networks", Networks Vol 59 (1) (2012) pp. 37-58.  PDF
  
  

• M. Lacroix, A. R. Mahjoub and S. Martin, “Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems”, Computers and Industrial Engineering Vol 61 (2) (2011) pp. 422-429.  PDF

• F. Bendali, I. Diarrassouba, A. R. Mahjoub, J. Mailfert, "On the k-edge hop-constrained paths polytope”,  Discrete Optimization Vol 7 (4) (2010) pp.222-233.  PDF

•  A. R. Mahjoub and S. T. McCormick, "Max Flow and Min Cut with Bounded-Length Paths: Complexity, Algorithms and Approximation", Mathematical Programming Vol 124 (1-2) (2010) pp. 271-284.  PDF

•    F. Bendali, I. Diarrassouba, M. Didi Biha, A. R. Mahjoub, J. Mailfert, “A Branch-and-Cut algorithm for the k-edge connected subgraph problem ”, Networks Vol 55 (1) (2010) pp. 13-32.  PDF

•  P. Fouilhoux, M. Labbé, A. R. Mahjoub, H. Yaman, "Generating procedures and non-rank facets for the independence system polytope", SIAM Journal on Discrete Mathematics Vol 23 (3) (2009) pp. 1484-1506.    PDF

•  Imed Kacem and A. R. Mahjoub, “Fully polynomial time approximation scheme for the weighted flow time minimization on a single machine with a fixed non-availability interval”, Computers and Industrial Engineering, Vol 56 (4) (2009) pp. 1708-1712.  PDF

•  M. Didi Biha, H. Kerivin and A. R. Mahjoub, "On the polytope of the (1,2)-Survivable Network Design Problem", SIAM Journal on D iscrete Mathematics. Vol 22 (4) (2008) pp. 1640-1666.   PDF

• A.R. Mahjoub and P. Pesneau "On the Steiner 2-edge connected subgraph polytope", RAIRO-OR  42 (2008) pp. 259-283.  PDF

•  H. Kerivin, M. Lacroix, A. R. Mahjoub, A. Quilliot,  "The splittable pickup and delivery problem with reloads", European Journal of Industrial Engineering, Vol 2, N#2 (2008) pp.112-133.  PDF

• M. Bouchakour, T. Contenza, C.W. Lee and A.R. Mahjoub, "On the dominating set polytope",  European Journal of Combinatorics 29 (2008), pp. 652-661.  PDF

• D. Cornaz and A. R. Mahjoub, “The maximum induced bipartite subgraph problem with edge weights”,  SIAM Journal on Discrete Mathematics 21(3) (2007), pages 662-675.  PDF

• D. Huygens and A. R. Mahjoub, “Integer programming formulations for two 4-hop-constrainded paths problem”, Networks 49 (2) (2007), pp. 135-144.  PDF

• D. Huygens, M. Labbé, A. R. Mahjoub and P. Pesneau, “The Two-Edge Connected Hop-Constrained Network design Problem : Valid Inequalities and Branch-and-Cut”, Networks 49 (1) (2007) pp. 116-133.  PDF

• G. Dahl, D. Huygens, A. R. Mahjoub and P. Pesneau, “On the k edge-disjoint 2-hop-constrained paths polytope”, Operations Research Letters 34 (2006), pp. 577-582. Résumé  PDF

• S. Borne, E. Gourdin, B. Liau and A. R. Mahjoub, “Design of Survivable IP-over-Optical Networks”, Annals of Operations Research 146 (1) (2006), pp. 41-73. Résumé  PDF

• P. Fouilhoux and A. R. Mahjoub , “Polyhedral results for the bipartite induced subgraph problem”, Discrete Applied Mathematics 154 (15) (2006), pp. 2128-2149. Résumé  PDF

• A. R. Mahjoub and J. Mailfert, “On the independent dominating set polytope”, European Journal of Combinatorics, 27, 4 (2006), pp. 601-616. Résumé  PDF

• J. Fonlupt and A.R. Mahjoub, " Critical extreme points of the 2-edge connected spanning subgraph polytope", Mathematical Programming.105 (2006) pp. 289-310. Résumé  PDF

• B. Fortz, T. McCormick, A. R. Mahjoub and P. Pesneau, “The 2-edge connected sub graph with bounded rings problem: Polyhedral results and Branch-and-Cut”, Mathematical Programming, 105, 1 (2006), pp 85-111. Résumé  PDF

• H. Kerivin and A. R. Mahjoub, “Design of Survivable Networks: A survey”, Networks, 46 (2005) pp. 1-21. Résumé  PDF

• H. Kerivin and A.R. Mahjoub, "On Survivable Network Polyhedra", Discrete Mathematics 290 (2005) pp. 183-210. Résumé  PDF

• D. Huygens, A.R. Mahjoub and P. Pesneau, “Two edge hop-constrained paths and polyhedra”, SIAM journal on Discrete Mathematics 18 (2) (2004) pp. 287-312. Résumé  PDF

• M. Didi Biha and A. R. Mahjoub, “The k-edge subgraph problem I: Critical extreme points”, Linear Algebra and its Applications 381 (2004) pp. 117-139. Résumé  PDF

• H. Kerivin, A.R. Mahjoub and C. Nocq "(1,2)-Survivable Networks: Facets and Branch&Cut", The Sharpest-Cut, M. Grötschel (Editor), MPS/SIAM Optimization, (2004) pp. 121-152. Résumé

• H. Kerivin and A.R. Mahjoub, "Separation of partition inequalities for the (1,2)-survivable network design problem", Operations Research Letters 30 (2002) pp. 265-268. Résumé  PDF

• M. Baïou and A.R. Mahjoub, "The Steiner Traveling Salesman Problem Polytope and Related Polyhedra", SIAM Journal on Optimization 13 (2002) pp. 498-507.  PDF

• F. Bendali, J. Mailfert and A.R. Mahjoub, "Compositions of graphs and the triangle free subgraph polytope", Journal of Combinatorial Optimization 6 (2002) pp. 359-381.  PDF

• M. Didi Biha, H. Kerivin and A.R. Mahjoub, "Steiner Trees and Polyhedra", Discrete Applied Mathematics 112 (2001) pp. 101-120.  Résumé  PDF

• M. Baïou, F. Barahona and A.R. Mahjoub, "Separating Partition Inequalities", Mathematics of Operations Research. Vol. 25, N# 2 (2000) pp. 243-254.  PDF

• M. Didi Biha and A.R. Mahjoub, "Steiner k-edge connected subgraph polyhedra", Journal of Combinatorial Optimization Vol 4, N# 1 (2000) pp. 131-144.   PDF

• A.R. Mahjoub and C. Nocq, "On the linear relaxation of the 2-node connected subgraph polytope", Discrete Applied Mathematics 95 (1999) pp. 389-416.  PDF

• M. Bouchakour and A.R. Mahjoub, "One-node cutsets and the dominating set polytope", Discrete Mathematics 165/166 (1997), pp. 101-123.  PDF

• M. Baïou and A.R. Mahjoub, "Steiner 2-edge connected subgraph polytopes on series-parallel graphs", SIAM Journal on Discrete Mathematics Vol 10, No. 3, (1997), pp. 505-514.  PDF

• A.R. Mahjoub, "On perfectly two-edge connected graphs", Discrete Mathematics 170 (1997), pp. 153-172.  PDF

• M. Didi Biha and A.R. Mahjoub, "k-Edge connected subgraph polyhedra on series-parallel graphs", Operations Research Letters 19 (1996), pp. 71-78.   PDF

• A. R. Mahjoub, "A min-max relation for K3-covers in graphs non contractible to K5\e", Discrete Applied Mathematics 62 (1995), pp. 209-219.   PDF

• F. Barahona and A.R. Mahjoub, "On two connected subgraph polytopes", Discrete Mathematics 147 (1995), pp. 19-34.   PDF

• F. Barahona, J. Fonlupt and A.R. Mahjoub, "Composition of graphs and polyhedra IV : Acyclic spanning subgraphs", SIAM Journal on Discrete Mathematics Vol 7, N# 3 (1994), pp. 390-402.   PDF

• F. Barahona and A.R. Mahjoub , "Composition of graphs and polyhedra III : Graphs with no W4 minor", SIAM Journal on Discrete Mathematics Vol 7, N#3 (1994), pp. 372-389.   PDF

• F. Barahona and A.R. Mahjoub, "Composition of graphs and polyhedra II : Stable Sets", SIAM Journal on Discrete Mathematics Vol 7, N# 3 (1994), pp. 359-371.   PDF

• F. Barahona and A.R. Mahjoub, "Composition of graphs and polyhedra I : Balanced induced subgraphs and acyclic subgraphs", SIAM Journal on Discrete Mathematics Vol 7, N# 3 (1994) pp. 344-358.   PDF

• A.R. Mahjoub, "Two edge connected spanning subgraphs and polyhedra", Mathematical Programming 64 (1994), pp. 199-208.   PDF

• J. Fonlupt, A.R. Mahjoub and J.P. Uhry, "Composition in the bipartite subgraph polytope", Discrete Mathematics 105 (1992), pp. 73-91.   PDF

• R. Euler and A.R. Mahjoub, "On a composition of independence systems by circuits-identification", Journal of Combinatorial Theory Séries B, Vol 53, N# 2 (1991), pp. 235-259.  PDF

• R. Euler and A.R. Mahjoub , "Balanced matrices and the set covering problem", Arabian Journal for Science and Engineering, Vol 16, N# 2B (1991), pp. 269-282.   PDF

• J.I. Brown, D.G. Corneil and A.R. Mahjoub, "A note on Ki-perfect graphs", Journal of graph theory 14, N# 3 (1990), pp. 333-340.   PDF

• F. Barahona and A.R. Mahjoub, "Facets of the balanced (acyclic) induced subgraph polytope", Mathematical Programming 45 (1989) pp. 21-34.   PDF

• A.R. Mahjoub, "On the stable set polytope of a series-parallel graph", Mathematical Programming 40 (1988) pp. 53-57.   PDF

• M. Conforti, D.G. Corneil and A.R. Mahjoub, "Ki-covers II : Ki-perfect graphs", Journal of Graph Theory 11, N# 4 (1987), pp. 569-584.   PDF

• F. Barahona and A.R. Mahjoub, "On the cut polytope", Mathematical Programming 36 (1986) pp. 157-173.   PDF

• M. Conforti, D.G. Corneil and A.R. Mahjoub, "Ki-covers I : complexity and polytopes", Discrete Mathematics 58, 2 (1986) pp. 121-142.   PDF

• F. Barahona, M. Grötschel and A.R. Mahjoub, "Facets of the bipartite subgraph polytope", Mathematics of Operations Research 10 (1985) pp. 340-358.   PDF

• A.R. Mahjoub, "Polytope des absorbants dans une classe de graphes à seuil", Annals of Discrete Mathematics 17 (1983) pp. 443-452.  PDF