default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMéziane Aïder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Thiziri Sifaoui
, Méziane Aïder:
Beyond green borders: an innovative model for sustainable transportation in supply chains. RAIRO Oper. Res. 58(3): 2185-2237 (2024)- 2023
- [j26]Méziane Aïder, Imene Dey, Mhand Hifi:
A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem. Comput. Ind. Eng. 177: 108982 (2023) - [j25]Méziane Aïder, Aida-Ilham Azzi, Mhand Hifi:
The ɛ-constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p-Median Problems. Knowl. Based Syst. 265: 110363 (2023) - [j24]Méziane Aïder, Oussama Gacem, Mhand Hifi:
Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem. Neural Comput. Appl. 35(2): 1183-1209 (2023) - [j23]Chafia Boughani, Méziane Aïder:
Conflict hypergraphs to define new families of facets for the independence system polytope. RAIRO Oper. Res. 57(2): 631-648 (2023) - 2022
- [j22]Méziane Aïder, Oussama Gacem, Mhand Hifi:
A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem. Expert Syst. Appl. 191: 116238 (2022) - [j21]Samira Bokhari, Sofiane Hamrioui, Méziane Aïder:
Cybersecurity strategy under uncertainties for an IoE environment. J. Netw. Comput. Appl. 205: 103426 (2022) - [j20]Méziane Aïder, Oussama Gacem, Mhand Hifi:
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem. J. Oper. Res. Soc. 73(3): 540-557 (2022) - [p1]Thiziri Sifaoui, Méziane Aïder:
A Multi-objective Solid Transportation Problem in Sustainable Development. Computational Intelligence Methodologies Applied to Sustainable Development Goals 2022: 235-254 - 2021
- [j19]Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi:
A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors. Comput. Ind. Eng. 158: 107388 (2021) - 2020
- [j18]Méziane Aïder, Asma Skoudarli:
Tackling the Multi-Objective Vehicle Routing Problem With Uncertain Demands. Int. J. Appl. Metaheuristic Comput. 11(1): 1-22 (2020) - [j17]Thiziri Sifaoui, Méziane Aïder:
Uncertain interval programming model for multi-objective multi-item fixed charge solid transportation problem with budget constraint and safety measure. Soft Comput. 24(13): 10123-10147 (2020) - [c4]Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi:
A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors. WCO@FedCSIS 2020: 157-178 - [c3]Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi:
A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors. FedCSIS 2020: 257-261
2010 – 2019
- 2019
- [j16]Ibtissam Ahmia, Méziane Aïder:
A novel metaheuristic optimization algorithm: the monarchy metaheuristic. Turkish J. Electr. Eng. Comput. Sci. 27(1): 362-376 (2019) - [j15]Larbi Asli, Méziane Aïder, El-Ghazali Talbi:
Solving a dynamic combinatorial auctions problem by a hybrid metaheuristic based on a fuzzy dominance relation. RAIRO Oper. Res. 53(1): 207-221 (2019) - [j14]Méziane Aïder, Lamia Aoudia, Mourad Baïou, Ali Ridha Mahjoub, Viet Hung Nguyen:
On the star forest polytope for trees and cycles. RAIRO Oper. Res. 53(5): 1763-1773 (2019) - 2016
- [j13]Méziane Aïder, Sylvain Gravier, Souad Slimani:
Relaxed Locally Identifying Coloring of Graphs. Graphs Comb. 32(5): 1651-1665 (2016) - 2015
- [i1]Méziane Aïder, Sylvain Gravier, Souad Slimani:
Relaxed Locally Identifying Coloring of Graphs. CTW 2015: 85-88 - 2014
- [c2]Lamia Aoudia, Viet Hung Nguyen, Ali Ridha Mahjoub, Méziane Aïder:
On the star forest polytope. CoDIT 2014: 263-268 - 2010
- [j12]Chahrazad Adiche, Méziane Aïder:
A Hybrid Method for Solving the Multi-objective Assignment Problem. J. Math. Model. Algorithms 9(2): 149-164 (2010)
2000 – 2009
- 2009
- [j11]Kahina Meslem, Méziane Aïder:
On an extension of distance hereditary graphs. Discret. Math. 309(11): 3644-3652 (2009) - [j10]Méziane Aïder, Sylvain Gravier, Kahina Meslem:
Isometric embeddings of subdivided connected graphs into hypercubes. Discret. Math. 309(22): 6402-6407 (2009) - 2008
- [j9]Méziane Aïder:
Bipartite almost distance-hereditary graphs. Discret. Math. 308(5-6): 865-871 (2008) - [j8]Chahrazad Adiche, Méziane Aïder:
New variants of simulated annealing for solving a biobjective assignment problem. Rev. d'Intelligence Artif. 22(2): 237-255 (2008) - 2006
- [j7]Méziane Aïder, Sylvain Gravier, Kahina Meslem:
Isometric embedding of subdivided Connected graphs in the hypercube. Electron. Notes Discret. Math. 24: 145-151 (2006) - 2005
- [j6]Kahina Meslem, Méziane Aïder:
On an extension of distance-hereditary graphs. Electron. Notes Discret. Math. 22: 253-259 (2005) - [j5]Méziane Aïder, Mustapha Aouchiche:
Distance monotonicity and a new characterization of Hamming graphs. Inf. Process. Lett. 96(6): 207-213 (2005) - 2004
- [j4]Méziane Aïder:
Extended Distance-Hereditary Graphs. Electron. Notes Discret. Math. 17: 15-17 (2004) - [c1]Méziane Aïder:
Extended Distance-Hereditary Graphs. CTW 2004: 21-23 - 2002
- [j3]Méziane Aïder:
Almost distance-hereditary graphs. Discret. Math. 242(1-3): 1-16 (2002) - [j2]Méziane Aïder, Mustapha Aouchiche:
Distance monotonicity and a new characterization of hypercubes. Discret. Math. 245(1-3): 55-62 (2002) - 2000
- [j1]Méziane Aïder, Sylvain Gravier:
Critical graphs for clique-coloring. Electron. Notes Discret. Math. 5: 3-6 (2000)
1980 – 1989
- 1987
- [b1]Méziane Aïder:
Réseaux d'interconnexion bipartis : colorations généralisées dans les graphes. (Bipartite interconnection networks. Generalized colournigs in graphs). Joseph Fourier University, Grenoble, France, 1987
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
