( en | de | ru )

 

Disambiguation of "Hao, Jin-Kao"

Author of the publication

copydeleteadd this publication to your clipboard
Une approche hybride pour l'optimisation multi-objectif sous contraintes.

, and . JFPLC, page 33-46. Hermes/Lavoisier, (2003)

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.

Jin Hao

Jin Hao

Hao-Yan Jin

Odej Kao

Daniela Kao

 

Other publications of authors with the same name

Hybrid Metaheuristics for the Graph Partitioning Problem., and . Hybrid Metaheuristics, volume 434 of Studies in Computational Intelligence, Springer, (2013)Memetic Search for Identifying Critical Nodes in Sparse Graphs., , and . IEEE Trans. Cybern., 49 (10): 3699-3712 (2019)Memetic search for composing medical crews with equity and efficiency., , , and . Appl. Soft Comput., (2020)Iterated hyperplane search for the budgeted maximum coverage problem., and . Expert Syst. Appl., (2023)Métaheuristiques pour la classification de bouchons naturels en liège., and . Rev. d'Intelligence Artif., 16 (6): 785-806 (2002)Global optimization and structural analysis of Coulomb and logarithmic potentials on the unit sphere using a population-based heuristic approach., , , and . Expert Syst. Appl., 238 (Part A): 121704 (March 2024)A Population and Interval Constraint Propagation Algorithm., and . EMO, volume 2632 of Lecture Notes in Computer Science, page 88-101. Springer, (2003)Hypervolume-Based Multi-Objective Path Relinking Algorithm., , and . EMO, volume 7811 of Lecture Notes in Computer Science, page 185-199. Springer, (2013)Evolutionary Computing for the Satisfiability Problem., , and . EvoWorkshops, volume 2611 of Lecture Notes in Computer Science, page 258-267. Springer, (2003)Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm., and . AIMSA, volume 5253 of Lecture Notes in Computer Science, page 262-273. Springer, (2008)