( en | de | ru )

 

Disambiguation of "Basseur, Matthieu"

Author of the publication

copydeleteadd this publication to your clipboard
Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem.

, , , and . WEA, volume 3059 of Lecture Notes in Computer Science, page 72-86. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Friedrich Matthieu

Matthieu Saubanère

Matthieu Hammer

Matthieu Felsinger

Matthieu Barukinamwo

 

Other publications of authors with the same name

Multi-objective optimization using metaheuristics: non-standard algorithms., , , and . Int. Trans. Oper. Res., 19 (1-2): 283-305 (2012)On optimizing a bi-objective flowshop scheduling problem in an uncertain environment., , , , and . Comput. Math. Appl., 64 (12): 3747-3762 (2012)ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization., , , and . EMO, volume 4403 of Lecture Notes in Computer Science, page 386-400. Springer, (2007)Solving bi-objective flow shop problem with hybrid path relinking algorithm., , and . Appl. Soft Comput., 13 (10): 4118-4132 (2013)Path Relinking in Pareto Multi-objective Genetic Algorithms., , and . EMO, volume 3410 of Lecture Notes in Computer Science, page 120-134. Springer, (2005)Hypervolume-Based Multi-Objective Path Relinking Algorithm., , and . EMO, volume 7811 of Lecture Notes in Computer Science, page 185-199. Springer, (2013)Lorenz dominance based algorithms to solve a practical multiobjective problem., , and . Comput. Oper. Res., (2019)Expansion-based Hill-climbing., , and . Inf. Sci., (November 2023)Partial neighborhood local searches., , and . Int. Trans. Oper. Res., 29 (5): 2761-2788 (2022)The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems., , , and . J. Heuristics, 18 (2): 263-296 (2012)