Méziane Aïder

According to our database1, Méziane Aïder authored at least 19 papers between 1987 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

Tackling the Multi-Objective Vehicle Routing Problem With Uncertain Demands.
Int. J. Appl. Metaheuristic Comput., 2020

A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors.
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.
RAIRO Oper. Res., 2019

On the star forest polytope for trees and cycles.
RAIRO Oper. Res., 2019

2016
Relaxed Locally Identifying Coloring of Graphs.
Graphs Comb., 2016

2014
On the star forest polytope.
Proceedings of the International Conference on Control, 2014

2010
A Hybrid Method for Solving the Multi-objective Assignment Problem.
J. Math. Model. Algorithms, 2010

2009
Isometric embeddings of subdivided connected graphs into hypercubes.
Discret. Math., 2009

2008
New variants of simulated annealing for solving a biobjective assignment problem.
Rev. d'Intelligence Artif., 2008

Bipartite almost distance-hereditary graphs.
Discret. Math., 2008

2006
Isometric embedding of subdivided Connected graphs in the hypercube.
Electron. Notes Discret. Math., 2006

2005
Distance monotonicity and a new characterization of Hamming graphs.
Inf. Process. Lett., 2005

On an extension of distance-hereditary graphs.
Electron. Notes Discret. Math., 2005

2004
Extended Distance-Hereditary Graphs.
Electron. Notes Discret. Math., 2004

2002
Distance monotonicity and a new characterization of hypercubes.
Discret. Math., 2002

Almost distance-hereditary graphs.
Discret. Math., 2002

2000
Critical graphs for clique-coloring.
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).
PhD thesis, 1987


  Loading...