Hacène Aït Haddadène

According to our database, Hacène Aït Haddadène authored at least 17 papers between 1996 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

A MILP model to minimize total tardiness in a job shop scheduling problem with blocking and no-wait constraints.

Zineb Lissioued, Samia Ourari, Hacène Aït Haddadène

RAIRO Oper. Res., 2025

2023

Scheduling preemptive jobs on parallel machines with a conflict graph: a graph multi-colouring approach.

Adlane Baaziz, Hacène Aït Haddadène, Ammar Oulamara, Ahmed Kouider

Int. J. Math. Oper. Res., 2023

On P₅-free locally split graphs.

Hayat Issaadi, Hacène Aït Haddadène, Hamamache Kheddouci

Discuss. Math. Graph Theory, 2023

2021

A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach.

Ahmed Kouider, Hacène Aït Haddadène

Comput. Oper. Res., 2021

2019

An extension of adaptive multi-start tabu search for the maximum quasi-clique problem.

Youcef Djeddi, Hacène Aït Haddadène, Nabil Belacel

Comput. Ind. Eng., 2019

Contraction-based method for computing a lower bound on the clique number of a graph.

Assia Gueham, Hacène Aït Haddadène, Anass Nagih

Proceedings of the 6th International Conference on Control, 2019

2018

Graph coloring approach with new upper bounds for the chromatic number: team building application.

Assia Gueham, Anass Nagih, Hacène Aït Haddadène, Malek Masmoudi

RAIRO Oper. Res., 2018

2017

Mixed graph colouring for unit-time scheduling.

Ahmed Kouider, Hacène Aït Haddadène, Samia Ourari, Ammar Oulamara

Int. J. Prod. Res., 2017

An integration of Lagrangian split and VNS: The case of the capacitated vehicle routing problem.

Mouaouia Cherif Bouzid, Hacène Aït Haddadène, Saïd Salhi

Comput. Oper. Res., 2017

2015

Splitting a Giant Tour using Integer Linear Programming.

Mouaouia Cherif Bouzid, Hacène Aït Haddadène, Saïd Salhi

Electron. Notes Discret. Math., 2015

On the b-coloring of G-e.

Mohamed Zamime, Mekkia Kouider, Hacène Aït Haddadène

Discret. Appl. Math., 2015

Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling.

Ahmed Kouider, Hacène Aït Haddadène, Samia Ourari, Ammar Oulamara

Proceedings of the IEEE International Conference on Automation Science and Engineering, 2015

2014

Two bounds of chromatic number in graphs coloring problem.

Assia Gueham, Anass Nagih, Hacène Aït Haddadène

Proceedings of the International Conference on Control, 2014

2003

On the quasi-locally paw-free graphs.

Hacène Aït Haddadène, Meriem Mechebbek

Discret. Math., 2003

1998

An algorithm for coloring some perfect graphs.

Hacène Aït Haddadène, Sylvain Gravier, Frédéric Maffray

Discret. Math., 1998

1997

Coloring perfect degenerate graphs.

Hacène Aït Haddadène, Frédéric Maffray

Discret. Math., 1997

1996

On weakly diamond-free Berge graphs.

Hacène Aït Haddadène, Sylvain Gravier

Discret. Math., 1996