Méziane Aïder

According to our database, Méziane Aïder authored at least 31 papers between 1987 and 2024.

Collaborative distances:

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

2024

Beyond green borders: an innovative model for sustainable transportation in supply chains.

Thiziri Sifaoui, Méziane Aïder

RAIRO Oper. Res., 2024

2023

The ɛ-constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p-Median Problems.

Méziane Aïder, Aida-Ilham Azzi, Mhand Hifi

Knowl. Based Syst., April, 2023

Conflict hypergraphs to define new families of facets for the independence system polytope.

Chafia Boughani, Méziane Aïder

RAIRO Oper. Res., March, 2023

A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem.

Méziane Aïder, Imene Dey, Mhand Hifi

Comput. Ind. Eng., March, 2023

Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem.

Méziane Aïder, Oussama Gacem, Mhand Hifi

Neural Comput. Appl., 2023

2022

A Multi-objective Solid Transportation Problem in Sustainable Development.

Thiziri Sifaoui, Méziane Aïder

Proceedings of the Computational Intelligence Methodologies Applied to Sustainable Development Goals, 2022

Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem.

Méziane Aïder, Oussama Gacem, Mhand Hifi

J. Oper. Res. Soc., 2022

Cybersecurity strategy under uncertainties for an IoE environment.

Samira Bokhari, Sofiane Hamrioui, Méziane Aïder

J. Netw. Comput. Appl., 2022

A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem.

Méziane Aïder, Oussama Gacem, Mhand Hifi

Expert Syst. Appl., 2022

2021

A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors.

Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi

Comput. Ind. Eng., 2021

2020

Uncertain interval programming model for multi-objective multi-item fixed charge solid transportation problem with budget constraint and safety measure.

Thiziri Sifaoui, Méziane Aïder

Soft Comput., 2020

Tackling the Multi-Objective Vehicle Routing Problem With Uncertain Demands.

Méziane Aïder, Asma Skoudarli

Int. J. Appl. Metaheuristic Comput., 2020

A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors.

Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi

Proceedings of the Recent Advances in Computational Optimization, 2020

A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors.

Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi

Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

2019

Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation.

Larbi Asli, Méziane Aïder, El-Ghazali Talbi

RAIRO Oper. Res., 2019

On the star forest polytope for trees and cycles.

Méziane Aïder, Lamia Aoudia, Mourad Baïou, Ali Ridha Mahjoub, Viet Hung Nguyen

RAIRO Oper. Res., 2019

A novel metaheuristic optimization algorithm: the monarchy metaheuristic.

Ibtissam Ahmia, Méziane Aïder

Turkish J. Electr. Eng. Comput. Sci., 2019

2016

Relaxed Locally Identifying Coloring of Graphs.

Méziane Aïder, Sylvain Gravier, Souad Slimani

Graphs Comb., 2016

2014

On the star forest polytope.

Lamia Aoudia, Viet Hung Nguyen, Ali Ridha Mahjoub, Méziane Aïder

Proceedings of the International Conference on Control, 2014

2010

A Hybrid Method for Solving the Multi-objective Assignment Problem.

Chahrazad Adiche, Méziane Aïder

J. Math. Model. Algorithms, 2010

2009

Isometric embeddings of subdivided connected graphs into hypercubes.

Méziane Aïder, Sylvain Gravier, Kahina Meslem

Discret. Math., 2009

2008

New variants of simulated annealing for solving a biobjective assignment problem.

Chahrazad Adiche, Méziane Aïder

Rev. d'Intelligence Artif., 2008

Bipartite almost distance-hereditary graphs.

Méziane Aïder

Discret. Math., 2008

2006

Isometric embedding of subdivided Connected graphs in the hypercube.

Méziane Aïder, Sylvain Gravier, Kahina Meslem

Electron. Notes Discret. Math., 2006

2005

Distance monotonicity and a new characterization of Hamming graphs.

Méziane Aïder, Mustapha Aouchiche

Inf. Process. Lett., 2005

On an extension of distance-hereditary graphs.

Kahina Meslem, Méziane Aïder

Electron. Notes Discret. Math., 2005

2004

Extended Distance-Hereditary Graphs.

Méziane Aïder

Electron. Notes Discret. Math., 2004

2002

Distance monotonicity and a new characterization of hypercubes.

Méziane Aïder, Mustapha Aouchiche

Discret. Math., 2002

Almost distance-hereditary graphs.

Méziane Aïder

Discret. Math., 2002

2000

Critical graphs for clique-coloring.

Méziane Aïder, Sylvain Gravier

Electron. Notes Discret. Math., 2000

1987

Réseaux d'interconnexion bipartis : colorations généralisées dans les graphes. (Bipartite interconnection networks. Generalized colournigs in graphs).

Méziane Aïder

PhD thesis, 1987