Hacène Aït Haddadène

17 papers C 2Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
A MILP model to minimize total tardiness in a job shop scheduling problem with blocking and no-wait constraints.
RAIRO Oper. Res.
Zineb Lissioued, Samia Ourari, Hacène Aït Haddadène
2023 J jnl
On P
Discuss. Math. Graph Theory
Hayat Issaadi, Hacène Aït Haddadène, Hamamache Kheddouci
2023 J jnl
Scheduling preemptive jobs on parallel machines with a conflict graph: a graph multi-colouring approach.
Int. J. Math. Oper. Res.
Adlane Baaziz, Hacène Aït Haddadène, Ammar Oulamara, Ahmed Kouider
2021 J jnl
A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach.
Comput. Oper. Res.
Ahmed Kouider, Hacène Aït Haddadène
2019 J jnl
An extension of adaptive multi-start tabu search for the maximum quasi-clique problem.
Comput. Ind. Eng.
Youcef Djeddi, Hacène Aït Haddadène, Nabil Belacel
2019 C conf
Contraction-based method for computing a lower bound on the clique number of a graph.
CoDIT
Assia Gueham, Hacène Aït Haddadène, Anass Nagih
2018 J jnl
Graph coloring approach with new upper bounds for the chromatic number: team building application.
RAIRO Oper. Res.
Assia Gueham, Anass Nagih, Hacène Aït Haddadène, Malek Masmoudi
2017 J jnl
An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem.
Comput. Oper. Res.
Mouaouia Cherif Bouzid, Hacène Aït Haddadène, Saïd Salhi
2017 J jnl
Mixed graph colouring for unit-time scheduling.
Int. J. Prod. Res.
Ahmed Kouider, Hacène Aït Haddadène, Samia Ourari, Ammar Oulamara
2015 — conf
Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling.
CASE
Ahmed Kouider, Hacène Aït Haddadène, Samia Ourari, Ammar Oulamara
2015 J jnl
On the b-coloring of G-e.
Discret. Appl. Math.
Mohamed Zamime, Mekkia Kouider, Hacène Aït Haddadène
2015 J jnl
Splitting a Giant Tour using Integer Linear Programming.
Electron. Notes Discret. Math.
Mouaouia Cherif Bouzid, Hacène Aït Haddadène, Saïd Salhi
2014 C conf
Two bounds of chromatic number in graphs coloring problem.
CoDIT
Assia Gueham, Anass Nagih, Hacène Aït Haddadène
2003 J jnl
On the quasi-locally paw-free graphs.
Discret. Math.
Hacène Aït Haddadène, Meriem Mechebbek
1998 J jnl
An algorithm for coloring some perfect graphs.
Discret. Math.
Hacène Aït Haddadène, Sylvain Gravier, Frédéric Maffray
1997 J jnl
Coloring perfect degenerate graphs.
Discret. Math.
Hacène Aït Haddadène, Frédéric Maffray
1996 J jnl
On weakly diamond-free Berge graphs.
Discret. Math.
Hacène Aït Haddadène, Sylvain Gravier