| An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem. MC Bouzid, H Aït Haddadène, S Salhi Computers & OR 78, 513-525, 2017 | 27 | 2017 |
| Mixed graph colouring for unit-time scheduling A Kouider, H Ait Haddadène, S Ourari, A Oulamara International Journal of Production Research 55 (6), 1720-1729, 2017 | 20 | 2017 |
| Coloring perfect degenerate graphs H Ait Haddadène, F Maffray Discrete Mathematics 163 (1), 211-215, 1997 | 19 | 1997 |
| An extension of adaptive multi-start tabu search for the maximum quasi-clique problem Y Djeddi, H Ait Haddadene, N Belacel Computers & Industrial Engineering, 2019 | 12 | 2019 |
| On weakly diamond-free Berge graphs H Ait Haddadene, S Gravier Discrete Mathematics 159 (1), 237-240, 1996 | 12 | 1996 |
| Perfect Graphs and Vertex Coloring Problem H AitHaddadene, H Issaadi IAENG International Journal of Applied Mathematics 39 (2), 128-133, 2009 | 11 | 2009 |
| An algorithm for coloring some perfect graphs H Ait Haddadene, S Gravier, F Maffray Discrete mathematics 183 (1), 1-16, 1998 | 11 | 1998 |
| Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling A Kouider, H Ait Haddadene, S Ourari, A Oulamara 2015 IEEE International Conference on Automation Science and Engineering …, 2015 | 10 | 2015 |
| A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: A mixed graph coloring approach A KOUIDER, HAIT HADDADÈNE Computers & Operations Research 132, 105319, 2021 | 5 | 2021 |
| On the b-coloring of G− e M Zamime, M Kouider, H Ait Haddadène Discrete Applied Mathematics 188, 41-50, 2015 | 4 | 2015 |
| A labeling order scheme for the maximum clique problem A Gueham, H Ait Haddadene, A Nagih Applied Mathematical Sciences 6 (109), 5439-5452, 2012 | 4 | 2012 |
| Two bounds of chromatic number in graphs coloring problem A Gueham, A Nagih, H Ait Haddadene 2014 International Conference on Control, Decision and Information …, 2014 | 3 | 2014 |
| On the quasi-locally paw-free graphs H Ait Haddadene, M Mechebbek Discrete mathematics 266 (1), 37-40, 2003 | 3 | 2003 |
| Graph coloring approach with new upper bounds for the chromatic number: team building application A Gueham, A Nagih, H Ait Haddadene, M Masmoudi RAIRO-Operations Research 52 (3), 807-818, 2018 | 2 | 2018 |
| Splitting a Giant Tour using Integer Linear Programming MC Bouzid, H Ait Haddadene, S Salhi Electronic Notes in Discrete Mathematics 47, 245-252, 2015 | 2 | 2015 |
| Coloration de Graphes Mixtes et son Application à l’Ordonnancemen Job Shop A Kouider, H Ait Haddadene, S Ourari, A Oulamara MOSIM 2014, 10ème Conférence Francophone de Modélisation, Optimisation et …, 2014 | 2 | 2014 |
| Maintaining graph properties of weakly chordal graphs MA Boutiche, H Ait Haddadene, HA Le Thi Applied Mathematical Sciences 6 (16), 765-778, 2012 | 2 | 2012 |
| On P5-free Locally Split Graphs H Issaadi, HA Haddadene, H Kheddouci Discussiones Mathematicae Graph Theory 43, 1063-1090, 2023 | | 2023 |
| Scheduling preemptive jobs on parallel machines with a conflict graph: a graph multi-colouring approach A Baaziz, HA Haddadène, A Oulamara, A Kouider International Journal of Mathematics in Operational Research 25 (1), 47-67, 2023 | | 2023 |
| Contraction-based method for computing a lower bound on the clique number of a graph A Gueham, HAIT Haddadene, A Nagih 2019 6th International Conference on Control, Decision and Information …, 2019 | | 2019 |
Pr. Ammar OulamaraUniversité de LorraineVerified email at loria.fr
