Hacène Aït Haddadène

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 11

Top Topics

Top Venues

Comput. Oper. Res.

RAIRO Oper. Res.

Int. J. Prod. Res.

Publications

Hayat Issaadi, Hacène Aït Haddadène, Hamamache Kheddouci
-free locally split graphs. Discuss. Math. Graph Theory 43 (4) (2023)
Adlane Baaziz, Hacène Aït Haddadène, Ammar Oulamara, Ahmed Kouider
Scheduling preemptive jobs on parallel machines with a conflict graph: a graph multi-colouring approach. Int. J. Math. Oper. Res. 25 (1) (2023)
Ahmed Kouider, Hacène Aït Haddadène
A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach. Comput. Oper. Res. 132 (2021)
Assia Gueham, Hacène Aït Haddadène, Anass Nagih
Contraction-based method for computing a lower bound on the clique number of a graph. CoDIT (2019)
Youcef Djeddi, Hacène Aït Haddadène, Nabil Belacel
An extension of adaptive multi-start tabu search for the maximum quasi-clique problem. Comput. Ind. Eng. 132 (2019)
Assia Gueham, Anass Nagih, Hacène Aït Haddadène, Malek Masmoudi
Graph coloring approach with new upper bounds for the chromatic number: team building application. RAIRO Oper. Res. 52 (3) (2018)
Mouaouia Cherif Bouzid, Hacène Aït Haddadène, Saïd Salhi
An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem. Comput. Oper. Res. 78 (2017)
Ahmed Kouider, Hacène Aït Haddadène, Samia Ourari, Ammar Oulamara
Mixed graph colouring for unit-time scheduling. Int. J. Prod. Res. 55 (6) (2017)
Ahmed Kouider, Hacène Aït Haddadène, Samia Ourari, Ammar Oulamara
Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling. CASE (2015)
Mohamed Zamime, Mekkia Kouider, Hacène Aït Haddadène
On the b-coloring of G-e. Discret. Appl. Math. 188 (2015)
Mouaouia Cherif Bouzid, Hacène Aït Haddadène, Saïd Salhi
Splitting a Giant Tour using Integer Linear Programming. Electron. Notes Discret. Math. 47 (2015)
Assia Gueham, Anass Nagih, Hacène Aït Haddadène
Two bounds of chromatic number in graphs coloring problem. CoDIT (2014)
Hacène Aït Haddadène, Meriem Mechebbek
On the quasi-locally paw-free graphs. Discret. Math. 266 (1-3) (2003)
Hacène Aït Haddadène, Sylvain Gravier, Frédéric Maffray
An algorithm for coloring some perfect graphs. Discret. Math. 183 (1-3) (1998)
Hacène Aït Haddadène, Frédéric Maffray
Coloring perfect degenerate graphs. Discret. Math. 163 (1-3) (1997)
Hacène Aït Haddadène, Sylvain Gravier
On weakly diamond-free Berge graphs. Discret. Math. 159 (1-3) (1996)