ACTIVITES DE RECHERCHE

HABILITATIONS UNIVERSITAIRES

  1. Kouider Ahmed : USTHB, Alger, 22 Décembre 2021.

DOCTORATS SOUTENUS

  1. Issaadi Hayat : Sur quelques classes de graphes et problème de coloration, 31 Mars 2022,  Directeur de thèse : AIT HADDADENE Hacène (USTHB, Alger), co-Directeur de thèse : KHEDDOUCI Hamamache (U-Lyon 1, France).
  2. Djeddi  Youcef : Algorithmes des problèmes de la clique  maximum et ses applications dans les réseaux biologiques,  2019, thèse co-dirigée par Hacène Ait Haddadène (USTHB, Alger) &  Nabil  Belacel (CNRC, Ottawa, Canada) ;
  3. Kouider Ahmed : Coloration de Graphes et ses applications aux Problèmes d’Ordonnancement, 17 mars 2018, thèse co-dirigée par Hacène Ait Haddadène (USTHB, Alger) & Ammar Oulamara (Université de Lorraine, France) ;
  4. Yagouni Mohammed : Contribution à la résolution des problèmes complexes de l’optimisation combinatoire, 01 juillet 2017, thèse co-dirigée par Hacène Ait Haddadène (USTHB, Alger) & Hoai An Le Thi (Université de Lorraine, France) ;
  5. Gueham Assia : Techniques de coloration et de génération de colonnes, Applications à la confection d’horaires, 13 mai 2017, thèse co-dirigée par Hacène Ait Haddadène (USTHB, Alger) & Anass Nagih (Université de Lorraine, France) ;
  6. Bouzid Cherif Mouaouia : Contribution à la résolution de quelques problèmes de distribution, 15 janvier 2017 , thèse co-dirigée par Hacène Ait Haddadène (USTHB, Alger) & Said Salhi (Université de Canterbury, KBS, UK) ;
  7. Zamime Mohamed : Contribution à l’étude des problèmes de la b-coloration dans les graphes, 13 décembre 2015, thèse dirigée par Hacène Ait Haddadène (USTHB, Alger)  ;
  8. Boutiche Mohamed Amine : Techniques de Décompositions de graphes appliquées au problème de routage, 12 décembre 2013, thèse co-dirigée par Hacène Ait Haddadène (USTHB, Alger) & Hoai An Le Thi (Université de Lorraine, France) ;
  9. Mechebbek Meriem : Etude structurelle de quelques classes de graphes, 21 février 2013, thèse dirigée par Hacène Ait Haddadène (USTHB, Alger).

PUBLICATIONS

  1. L. Belhocine, M. Dahane, M. Yagouni : “Customer behavior –based multi-objective approach for the recovery and remanufacturing of used products:  application to Smartphone reconditioning process”, The International Journal of Advanced Manufacturing Technology (IF : 3.26), Received:  21 March 2021. Accepted : 5 July 2021. https://doi.org/10.1007/s00170-021-07646-7 
  2. M. A Boutiche, G. Guettai, M. Rahmani, M. Sebaoui, A three-term recurrence formula for the generalized Bernoulli polynomials, Boletim da Sociedade Paranaense de Matemática 39 (6), 139-145 (2021);
  3. I. Khettabi, L. Benyoucef and M.A. Boutiche, Sustainable reconfigurable manufacturing system design using adapted multi-objective evolutionary based approaches, The International Journal of Advanced Manufacturing Technology 115, pages 3741–3759 (2021);
  4. Malika Mimouni, Mohamed  Zamime,  Noureddine   Ikhlef  Eschouf ,  On connected 3 gamma_{L}-Dot-critical graphs. Iranian Mathematical Society. DOI: 10.1007/s41980-021_00558-y;
  5. Hayat Issaadi, Hacene Ait Haddadene, and Hamamache Kheddouci. On P5-free locally split graphs.
    Discussiones Mathematicae Graph Theory, pages 1–28, 2021, doi.org/10.7151/dmgt.2418; 
    https ://www.dmgt.uz.zgora.pl/publish/inpress.php. ;
  6. A.Kouider & H .Ait Haddadene, A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: A mixed graph coloring approach, Computers & Operations Research, Volume 132, 105319, 2021, DOI: 10.1016/j.cor.2021.105319,  https://www.sciencedirect.com/science/article/abs/pii/S0305054821001052;
  7. S. Samir, A.H. Lethi, M. Yagouni : “DCA-Like, GA and MBO: A Novel Hybrid Approach for Binary Quadratic Programs”, Chapter in Advances in Intelligent Systems and Computing , Springer, 11 Mai 2020. https://hal.archives-ouvertes.fr/hal-02570327;
  8. Djeddi Youcef, Ait Haddadene Hacene  & Nabil Belacel, An extension of adaptive multi-start tabu search for the maximum quasi-clique problem; Computers & Industrial Engineering, Volume 132, June 2019, Pages 280-292; https://www.sciencedirect.com/science/article/abs/pii/S0360835219302517?via%3Dihub;
  9. Gueham Assia, Nagih Anass, Ait Haddadene Hacene, & Masmoudi Malek, Graph coloring approach with new upper bounds for the chromatic number : Team Bulding application, RAIRO (2018), https://www.rairo-ro.org/articles/ro/abs/2018/03/ro151127/ro151127.html ;
  10. Boutiche Mohamed Amine, Belbachir Hacène, & Medjerredine Assia, Stirling and r-Stirling Numbers of the Second Kind, Mediterranean Journal of Mathematics (2018),
    https://doi.org/10.1007/s00009-018-1130-z ;
  11. Boutiche Mohamed Amine, Srivastava Hari Mohan, & Rahmani Mourad, A class of Frobenius-type Eulerian polynomial, Rocky Mountain Journal of Mathematics (2018), https://projecteuclid.org/euclid.rmjm/1533230836 ;
  12. Mechacha Mohamed, Boutiche Mohamed Amine, Rahmani Mourad & Behloul Djilali, Some Results for q-Poly-Bernoulli Polynomials, Miskolc mathematical Notes, 2018 ; mat76.mat.uni-miskolc.hu/mnotes/download_article/2435.pdf ;
  13. Bouzid Mouaouia Cherif, Ait Haddadene Hacène & Salhi Said, An integration of Lagrangian split and VNS : The case of the capacitated vehicle routing problem, Computers & Operations Research (2017),
    http://www.sciencedirect.com/science/article/pii/S0305054816300338?via%3Dihub ;
  14. Boutiche Mohamed Amine, Rahmani Mourad & Srivastava H. M., Explicit formulas associated with some families of generalized Bernoulli and Euler polynomials, Mediterranean Journal of Mathematics, 2017, 
    https://link.springer.com/article/10.1007/s00009-017-0891-0 ;
  15. Srivastava Hari Mohan, Boutiche Mohamed Amine & Rahmani Mourad, Some Explicit formulas for the Frobenius – Euler polynomials of high order Appl. Math. & Inf. Sci.11, N°. 2, 621-626(2017),
    http://www.naturalspublishing.com/files/published/22ro5l4z8759mi.pdf ;
  16. Kouider Mekkia & Zamime Mohamed, On the b-coloring of tight graphs, Journal of combinatorial Optimization 33(1) :202-214(2017)
    https://link.springer.com/article/10.1007%2Fs10878-015-9946-y ;
  17. Kouider Ahmed, Ait Haddadene Hacène, Ourari Samia & Oulamara Ammar, Mixed graph colouring for unit-time scheduling, International Journal of Production Research Volume 55,2017-Issue 6, https://www.tandfonline.com/doi/abs/10.1080/00207543.2016.1224950
  18. Boutiche Mohamed Amine, Gutman Ivan & Lu Jia, On Distance in Complements of Graphs, Scientific Publications of the state University of Novi Pazar, Series A : Applied mathematics, Informatics and Mechanics (2016), http://www.np.ac.rs/en/publications ;
  19. Zamime Mohamed, Kouider Mekkia & Ait Haddadene Hacène, On the b-coloring of G-e, Discrete Applied Mathematics, 2015, http://www.sciencedirect.com/science/article/pii/S0166218X15001031 ;
  20. Zamime Mohamed, Kouider Mekkia, On the b-coloring of tight graphs, Journal of combinatorial optimization, 2015, http://link.springer.com/journal/10878 ;
  21. Bouzid Cherif Mouaouia, Ait Haddadene Hacène & Salhi Said, Splitting a Giant Tour using Integer Linear Programming, Electronique Notes in Discrete Mathematics, 2015,
    http://elseiver.com/locate/endm ;
  22. Kouider Ahmed, Ait Haddadene Hacène, Ourari Samia & Oulamara Ammar, Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling. CASE 2015 : 1177-1181,2015,
    https://ieeexplore.ieee.org/document/7294257 ;
  23. Boutiche Mohamed Amine ; Ait Haddadène Hacene, & H.A. Le Thi ; Maintaining Graph Properties of Weakly Chordal Graphs, Applied Mathematical Sciences, Volume 6 N°16, pp. 765-778, (2012),
    http://www.m-hikari.com/ams/ams-2012/ams-13-16-2012/bouticheAMS13-16-2012.pdf ;
  24. Gueham Assia, Ait Haddadène Hacene, & A.Nagih ; A labeling order scheme for the maximum clique problem ; Applied Mathematical Sciences, Vol. 6, 2012, n°109, 5439-5452,
    http://www.m-hikari.com/ams/ams-2012/ams-109-112-2012/nagihAMS109-112-2012.pdf ;
  25. Hoang Chin Tao, Maffray Frédéric & Mechebbek Meriem, A characterization of b-perfect graphs, Journal of graph theory 71(1)(2012),95-122 ;
    http://dl.acm.org/citation.cfm?id=2344203 ;
  26. Yagouni Mohammed, Using methaheuristics for optimizing satellite image registration, International journal of combinatorial optimization and informatics, Vol03 N°03, Sept-Dec 2012 ;
    http://www.redalyc.org/pdf/2652/265224452006.pdf ;
  27. Ait Haddadene Hacène, Bouchemakh Isma & Hifi Mhand, Operations Research Special issue : selection of best papers of the symposium ISOR’08, Internationale Studia Informatica Universalis, Editions Hermann(2012) 2012,
    http://www.editionshermann.fr/catalogue.php?menu=11&titre=Studia+informatica&rubid=54&type=Revues ;
  28. Ait Haddadene Hacène, Harik Hakim & Salhi Said, On the pagerank algorithm for the articles ranking, Lecture Notes in Engineering and Computer Science (2012),
    https://doaj.org/article/8d6463768a2542c5842756aff4124c8c ;
  29. Maffray Frédéric & Mechebbek Meriem,On b-perfect Chordal Graphs,Graphs and Combinatorics 25(3):365-375 (2009)
    https://link.springer.com/article/10.1007%2Fs00373-009-0845-9 ;
  30. Issaadi Hayat & Ait Haddadene Hacène, Perfect Graphs and Vertex colouring Problem of a Graph, 2009, IAENG International Journal of Applied Mathematics, Vol 39, pp128-133 ; 2009,
    http://www.iaeng.org/IAJM/current_issue.html ;
  31. Ait Haddadene Hacène & Mechebbek Meriem, On the quasi-locally paw-free graphs, Discrete Mathematics,266,37-40, 2003 ;
    https://www.sciencedirect.com/science/article/pii/S0012365X02007963?via%3Dihub ;
  32. Ait Haddadene Hacène, Gravier Sylvain & Maffray Frédéric, An algorithm for coloring some perfect graphs, Discrete Mathematics (183,1998/1-16), 1998,
    https://www.sciencedirect.com/science/article/pii/S0012365X97000824?via%3Dihub ;
  33. Ait Haddadene Hacène & Maffray Frédéric, Coloring perfect degenerate graphs,Discrete Mathematics (163,1997,211 215, 1997 ;
    https://www.sciencedirect.com/science/article/pii/S0012365X9600009X?via%3Dihub ;
  34. Ait Haddadene Hacène & Gravier Sylvain, On weakly diamond-free Berge graphs,Discrete Mathematics (159, 1996/ 237-240, 1996,
    https://www.sciencedirect.com/science/article/pii/0012365X96000313?via%3Dihub ;

COMMUNICATIONS

  1. M Gaham, M Kadri, A Maoudj, A Bendjelloul, A Kouider, B Mihoubi, K Tebani, B Bouzouia. Multi-Agent Control of an Industry 4.0 Cyber-physical Assembly Cell. Best Paper Award 1st National Conference on Applied Computing and Smart Technologies, July 10, 2021, ESI, Sidi Bel Abbes, Algeria ;
  2. Abderraouf Maoudj, Abdelfetah Hentout, Anders Lyhne Christensen, Ahmed Kouider. A fast constructive path planning algorithm for mobile robot navigation. 2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA).Vasteras, Sweden. DOI: 10.1109/ETFA45728.2021.9613217 ;
  3. I. Khettabi, L. Benyoucef and M.A. Boutiche, Sustainable Multi-objective Process Plan Generation in Rms: Dynamic Nsga-ii Vs New Dynamic Nsga-ii, The IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2021, 13-16 Décembre, Marina Bay Sands, Singapore;
  4. I. Khettabi, L. Benyoucef and M.A. Boutiche, Multi-objective Sustainable Process Plan Generation for RMS: NSGA-III Vs New NSGA-III,  In: Le Thi H.A., Pham Dinh T., Le H.M. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2021. Lecture Notes in Networks and Systems, vol 363. Springer;
  5. I. Khettabi, L. Benyoucef and M.A. Boutiche, Sustainable Process Plan Generation in RMS: A Comparative Study of Two Multi-objective Evolutionary Approaches, IFIP International conference Advances in Production Management Systems APMS 2021, 5-9 Septembre, Nantes, France;
  6. I. Khettabi, L. Benyoucef and M.A. Boutiche, NSGA-II vs NSGA-III for the Sustainable Multi-Objective Process Plan Generation in a Reconfigurable Manufacturing Environment, 17th IFAC Symposium on Information Control Problems in Manufacturing, INCOM 2021, 7-9 Juin, Budapest, Hongrie;
  7. M. Yagouni. “Collaboration et Coopération des Métaheuristiques : Une optimisation collective efficace”,  Séminaire International Mathématiques et l’Informatique/13-31/DZ – AJEAU 2021, AJEAU, https://www.aneau.org/ajeau/Gueham Assia, Ait Haddadene Hacene, Nagih Anass, Contraction-based method for computing a lower bound on the clique number of a graph.  CoDIT 2019: 1758-1762;  https://ieeexplore.ieee.org/document/8820347;
  8. Issaadi Hayat, Ait Haddadene Hacène, Kheddouci Hammamache, Polynomial algorithms of P5-free locally split graphs, 3rd International conference applied mathematics, computational sciences and system engineering, Rome, Italie, 2018 ;
  9. Issaadi Hayat , Ait Haddadene Hacène & Kheddouci Hammamache, Structure of P5-free locally split graphs, International conference of optimization and decision science, Taormina, Italie, 2018 ;
  10. Bouzefrane Mohamed, Zamime Mohamed, Bouchemakh Isma & Ikhlef Eschouf Nouredine, Trees with unique minimum glolal offensive alliance sets, COSI2018 Oran, Algérie, 2018 ;
  11. Zamime Mohamed, Element deletion changes in alliances of graphs, ICAAM2018 Sousse, Tunisie, 2018 ;
  12. Boutiche Mohamed Amine, On wiener index of complements of graphs, Cimpa School : Graph Theory and its applications Beyrouth, Liban, 2017 ;
  13. Boutiche Mohamed Amine & Rahmani Mourad, Some results on frobenius-type Eulerian polynomials, 30th International Conference of the Jangjeon mathematical Society (ICJMS-2017) Alger, Algérie, 2017.
  14. Bouzefrane Mohamed, Zamime Mohamed & Bouchemakh Isma, Characterization of Trees With Unique Minimum Global offensive alliance sets, ADAM 2017, Errachidia, Maroc, 2017 ;
  15. Boutiche Mohamed Amine, Sur la somme de toutes les distances dans les graphes, Colloque : Combinatoire, Algèbre et Théorie des Nombres, Monastir, Tunisie, 2016 ;
  16. Zamime Mohamed & Ait Haddadene Hacène, Some sub-critical classes of graphs, CO’2016, Canterbury, UK, 2016 ; www.kent.ac.uk/kbs/co2016,
  17. Bouzid Mouaouia Cherif , Ait Haddadène Hacène & Salhi Said, An Integration of Lagrangian Split and VNS : The case of the Capacitated Vehicle Routing Problemn  Management Mathematics Group, School of Mathematics, University of Birmingham, UK, 2016 ;
  18. Zamime Mohamed, Ikhlef Eschouf Nouredine, Ait Haddadene Hacène, Some results in edge b-critical graphs, ROADEF’2015 ; http://roadef2015@lsis.org, Marseille- France, 2015 ;
  19. Boutiche Mohamed Amine, Forwarding Indices of Some Graphs, Operational Research Practice in Africa (ORPA), Alger-Algérie, 2015 ;
  20. Boutiche Mohamed Amine, Forwarding Indices of Some Subdivision Graphs, CTW2015, 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization, Istanbul-Turquie, 2015 ;
  21. Boutiche Mohamed Amine, Forwarding Indices of Some Graph Operations, Conference on Discrete Mathematics and Computer Science, Dimacos’2015, Sidi Bel Abbes-Algérie, 2015 ;
  22. Issaadi Hayat, Ait Haddadene Hacène, Zenia Safia, On the partition of vertex’s neighborhood in a graph, Applied Mathematics and Computational Methods in Engineering, Barcelone-Spain, 2015 ;
  23. Kouider Ahmed, Ait Haddadene Hacene, Ourari Samia, Oulamara Ammar, Mixed Integer Linear Programs and Tabu Search Approch to solve mixed Graph Coloring fore Unit-Time Job Shop Scheduling, Eleven Annual IEEE International Conference on Automation Science and Engineering (IEEE CASE 2015), Sweden, 2015 ;
  24. Ait Haddadene Hacène, On the maximum clique number problem of P-graphs, World Congress on Engineering ; http://iaeng.org/WCE2015 , London-UK, 2015 ;
  25. Bouzid Cherif Mouaouia, Ait Haddadene Hacène, Salhi Said, Splitting a Giant Tour using Lagrangian Relaxation,27th European Conference on Opational Research ;http://www.euro2015.org , Glasgow-UK, 2015 ;
  26. Kouider Ahmed, Ait Haddadene Hacene, Ourari Samia, Oulamara Ammar Ordonnancement Job-Shop par coloration de graphes mixtes, 10ème Conférence Francophone de Modélisation, Optimisation et Simulation (MOSIM), Nancy 2014 ;
  27. Bouzid Mouaouia Cherif, Ait Haddadene Hacène, Salhi Said, An adaptative large neighborhood search heuristic for the truck & trailer routing problem, Euro Working group on vehicle routing & logistics optimization (VERLO2014), Oslo-Norway, 2014 ;
  28. Bouzid Mouaouia Cherif, Ait Haddadene Hacène, Salhi Said, Splitting neighborhood search method for solving the traveling tournaments problem, International conference on variable neighborhood search (VNS2014), Jerba-Tunisie, 2014 ;
  29. Hablal Houria, Ait Haddadene Hacène, Belacel Nabil, Laplacian matrixes based graph’s b-coloring for clustering,
    IFORS2014, Barcelone-Espagne, 2014 ;
  30. Boutiche Mohamed Amine, On Computing Some Topological Indices, International Congress in Honour of Professor Ravi P. Agarwal, Bursa-Turquie, 2014 ;
  31. Boutiche Mohamed Amine, Belbachir Hacène, Merrifield-Simmons and Hosoya index of Some Thorny Graphs
    Rencontre d’Analyse Mathématiques et ses Applications RAMA9, Laghouat-Algérie, 2014 ;
  32. Boutiche Mohamed Amine, The Wiener and Wiener Polarity Index of Sun Graphs, Congrès des Mathématiciens Algériens CMA, Tlemcen-Algérie, 2014 ;
  33. Ait Haddadene Hacène, Gueham Assia, Nagih Anass, On coloring delta(k)-graphs, World Congress on Engineering , Imperial College, London-UK, 2013 ; http://www.iaeng.org/WCE2013/
  34. Ait Haddadene Hacène, Belacel Nabil, Hablal Houria, SB-CLUST : Spectral b-Coloring based Clustering Algorithm, CIET Conference , Tunisie, 2013 ; http://ipco-co.com/presented%20papers/Poster/309.pdf
  35. Bouzid Mouaouia Cherif, Ait Haddadene Hacène, Salhi Said, Hybridisation of MIL formulations and VNS for a variety using of Routing Problems, EURO/Informs MMXIII, 26thEuropean Conference on Operational Research , Rome-Italy, 2013 ; http://www.euro-online.org/conf/euro26/program
  36. Bouzid Mouaouia Cherif, Ait Haddadene Hacène, Salhi Said, Route First Cluster Second-Based Formulations for a variety of routing problems, VeRoLoG 2013 ;Routingand Logistics, Southampton-UK, 2013 ; https://www.ocs.soton.ac.uk/index.php/verolog/verolog2013 ;
  37. Boutiche Mohamed Amine A fully dynamic algorithm for particular graph, COSI2013 ; CDTA-Alger, 2013 ;
    http://www.isima.fr/cosi/cosi2013/ ;
  38. Boutiche Mohamed Amine, Maintaining graph parameters whether clique insertion and/or deletion
    ICAAMM 2013 ; Turquie, 2013 ; http://www.ica3.yildiz.edu.tr/
  39. Mechebbek Meriem, On b-perfect graphs, CSASC2013 ;, Koper-Slovenia, 2013  http://www.hippocampus.si/ISBN/978-961-6832-40-3.pdf
  40. Boutiche Mohamed Amine, Maintenance des graphes faiblement triangulés, RAMA8, USTHB 2012 http://www.usthb.dz/RAMA8/
  41. Ait Haddadene Hacene & Hamadi Ahmed, Optimization QLNC Graphs, 21th British combinatorial Conference July 2007, University of Reading, 2007.
  42. Hamadi Ahmed & Ait Haddadene Hacene, Coloring Perfect Quasi-locally quasi-adjoin graphs, MCO’04, France, 2004 ;
  43. Zenia Safia & Ait Haddadene Hacene, Quasi-locally P*(w) graphs, COSI’04, Université de Tizi-Ouzou, 2004 ;
  44. Ait Haddadene Hacene, Sur la coloration optimale des graphes parfaits, Rencontre des Mathématiciens Algériens, Alger 2000.