Méziane Aïder

39 papers C 4Journal 30Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
An adaptative multi-objective scatter search for solving the dynamic bin packing problem.
J. Heuristics
Méziane Aïder, Sabrin Boulebene, Mhand Hifi
2025 J jnl
An exact algorithm for the minimum sum coloring problem on partially decomposable graphs.
RAIRO Oper. Res.
Fatma Tammal, Méziane Aïder
2025 J jnl
Handling the challenges of a green supply chain in the context of product blending transportation within a neutrosophic environment.
RAIRO Oper. Res.
Thiziri Sifaoui, Méziane Aïder
2024 J jnl
Beyond green borders: an innovative model for sustainable transportation in supply chains.
RAIRO Oper. Res.
Thiziri Sifaoui, Méziane Aïder
2023 J jnl
A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem.
Comput. Ind. Eng.
Méziane Aïder, Imene Dey, Mhand Hifi
2023 J jnl
Conflict hypergraphs to define new families of facets for the independence system polytope.
RAIRO Oper. Res.
Chafia Boughani, Méziane Aïder
2023 J jnl
Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem.
Neural Comput. Appl.
Méziane Aïder, Oussama Gacem, Mhand Hifi
2023 J jnl
The ɛ-constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p-Median Problems.
Knowl. Based Syst.
Méziane Aïder, Aida-Ilham Azzi, Mhand Hifi
2022 — conf
A Cooperative Population-Based Method for Solving the Max-Min Knapsack Problem with Multi-scenarios.
ISCMI
Méziane Aïder, Mhand Hifi, Khadidja Latram
2022 — ch.
A Multi-objective Solid Transportation Problem in Sustainable Development.
Computational Intelligence Methodologies Applied to Sustainable Development Goals
Thiziri Sifaoui, Méziane Aïder
2022 — conf
A Population-Based Algorithm for Solving the Fuzzy Capacitated Maximal Covering Location Problem.
ISCMI
Méziane Aïder, Imene Dey, Mhand Hifi
2022 J jnl
A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem.
Expert Syst. Appl.
Méziane Aïder, Oussama Gacem, Mhand Hifi
2022 J jnl
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem.
J. Oper. Res. Soc.
Méziane Aïder, Oussama Gacem, Mhand Hifi
2022 J jnl
Cybersecurity strategy under uncertainties for an IoE environment.
J. Netw. Comput. Appl.
Samira Bokhari, Sofiane Hamrioui, Méziane Aïder
2021 J jnl
A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors.
Comput. Ind. Eng.
Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi
2020 — conf
A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors.
WCO@FedCSIS
Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi
2020 C conf
A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors.
FedCSIS
Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi
2020 J jnl
Tackling the Multi-Objective Vehicle Routing Problem With Uncertain Demands.
Int. J. Appl. Metaheuristic Comput.
Méziane Aïder, Asma Skoudarli
2020 J jnl
Uncertain interval programming model for multi-objective multi-item fixed charge solid transportation problem with budget constraint and safety measure.
Soft Comput.
Thiziri Sifaoui, Méziane Aïder
2019 J jnl
A novel metaheuristic optimization algorithm: the monarchy metaheuristic.
Turkish J. Electr. Eng. Comput. Sci.
Ibtissam Ahmia, Méziane Aïder
2019 J jnl
On the star forest polytope for trees and cycles.
RAIRO Oper. Res.
Méziane Aïder, Lamia Aoudia, Mourad Baïou, Ali Ridha Mahjoub, Viet Hung Nguyen
2019 J jnl
Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation.
RAIRO Oper. Res.
Larbi Asli, Méziane Aïder, El-Ghazali Talbi
2016 J jnl
Relaxed Locally Identifying Coloring of Graphs.
Graphs Comb.
Méziane Aïder, Sylvain Gravier, Souad Slimani
2015 C conf
Relaxed Locally Identifying Coloring of Graphs.
CTW
Méziane Aïder, Sylvain Gravier, Souad Slimani
2014 C conf
On the star forest polytope.
CoDIT
Lamia Aoudia, Viet Hung Nguyen, Ali Ridha Mahjoub, Méziane Aïder
2010 J jnl
A Hybrid Method for Solving the Multi-objective Assignment Problem.
J. Math. Model. Algorithms
Chahrazad Adiche, Méziane Aïder
2009 J jnl
Isometric embeddings of subdivided connected graphs into hypercubes.
Discret. Math.
Méziane Aïder, Sylvain Gravier, Kahina Meslem
2009 J jnl
On an extension of distance hereditary graphs.
Discret. Math.
Kahina Meslem, Méziane Aïder
2008 J jnl
Bipartite almost distance-hereditary graphs.
Discret. Math.
Méziane Aïder
2008 J jnl
New variants of simulated annealing for solving a biobjective assignment problem.
Rev. d'Intelligence Artif.
Chahrazad Adiche, Méziane Aïder
2006 J jnl
Isometric embedding of subdivided Connected graphs in the hypercube.
Electron. Notes Discret. Math.
Méziane Aïder, Sylvain Gravier, Kahina Meslem
2005 J jnl
Distance monotonicity and a new characterization of Hamming graphs.
Inf. Process. Lett.
Méziane Aïder, Mustapha Aouchiche
2005 J jnl
On an extension of distance-hereditary graphs.
Electron. Notes Discret. Math.
Kahina Meslem, Méziane Aïder
2004 C conf
Extended Distance-Hereditary Graphs.
CTW
Méziane Aïder
2004 J jnl
Extended Distance-Hereditary Graphs.
Electron. Notes Discret. Math.
Méziane Aïder
2002 J jnl
Almost distance-hereditary graphs.
Discret. Math.
Méziane Aïder
2002 J jnl
Distance monotonicity and a new characterization of hypercubes.
Discret. Math.
Méziane Aïder, Mustapha Aouchiche
2000 J jnl
Critical graphs for clique-coloring.
Electron. Notes Discret. Math.
Méziane Aïder, Sylvain Gravier
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