2023 - Research.com Computer Science in France Leader Award
Mathematical optimization, Tabu search, Algorithm, Graph coloring and Local search are his primary areas of study. His Mathematical optimization study frequently draws connections to other fields, such as Benchmark. Jin-Kao Hao has researched Tabu search in several fields, including Hybrid algorithm, Set, Knapsack problem and Search algorithm.
His Algorithm research includes themes of Consistency, Heuristics and Cluster analysis. His studies in Graph coloring integrate themes in fields like Theoretical computer science, Greedy coloring, List coloring and Chordal graph. His Local search study combines topics in areas such as Maximum cut and Metaheuristic.
Jin-Kao Hao mainly investigates Mathematical optimization, Tabu search, Algorithm, Local search and Benchmark. His Mathematical optimization research incorporates elements of Set and Crossover. In his research on the topic of Tabu search, Iterated function is strongly related with Local optimum.
His research in Algorithm intersects with topics in Path, Evaluation function and Genetic algorithm. He interconnects Evolutionary algorithm and Vertex in the investigation of issues within Local search. His Benchmark study also includes
The scientist’s investigation covers issues in Mathematical optimization, Tabu search, Benchmark, Local search and Graph. His Mathematical optimization study frequently links to adjacent areas such as Crossover. His Tabu search research incorporates elements of Metaheuristic, Heuristics, Evolutionary algorithm, Combinatorial optimization and Bipartite graph.
His study in Benchmark is interdisciplinary in nature, drawing from both Theoretical computer science, Set, Code, Key and Search algorithm. His Local search study is associated with Algorithm. His research investigates the connection with Algorithm and areas like Conductance which intersect with concerns in Complex network and Quotient.
Jin-Kao Hao mostly deals with Mathematical optimization, Tabu search, Benchmark, Local search and Metaheuristic. His Mathematical optimization study frequently draws connections between related disciplines such as Crossover. He combines subjects such as Partition, Disjoint sets, Memetic algorithm, Evolutionary algorithm and Vertex with his study of Tabu search.
His Partition research incorporates themes from Conductance, Algorithm and Graph partition. His Benchmark research is multidisciplinary, incorporating perspectives in Theoretical computer science, Combinatorial optimization and Search algorithm. His biological study spans a wide range of topics, including Variable and Routing.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Transit network design and scheduling: A global review
Valérie Guihaire;Jin-Kao Hao.
Transportation Research Part A-policy and Practice (2008)
Hybrid Evolutionary Algorithms for Graph Coloring
Philippe Galinier;Jin-Kao Hao.
Journal of Combinatorial Optimization (1999)
Inferring gene regulatory networks from gene expression data by path consistency algorithm based on conditional mutual information
Xiujun Zhang;Xing-Ming Zhao;Kun He;Le Lu.
Bioinformatics (2012)
A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite
Michel Vasquez;Jin-Kao Hao.
Computational Optimization and Applications (2001)
Adaptive Tabu Search for course timetabling
Zhipeng Lü;Zhipeng Lü;Jin-Kao Hao.
European Journal of Operational Research (2010)
A review on algorithms for maximum clique problems
Qinghua Wu;Jin-Kao Hao.
European Journal of Operational Research (2015)
The unconstrained binary quadratic programming problem: a survey
Gary Kochenberger;Jin-Kao Hao;Fred Glover;Mark Lewis.
Journal of Combinatorial Optimization (2014)
A Memetic Algorithm for Graph Coloring
Zhipeng Lü;Jin-Kao Hao.
European Journal of Operational Research (2010)
Evolutionary Multi-Criterion Optimization
Matthias Ehrgott;Carlos M. Fonseca;Xavier Gandibleux;Jin-Kao Hao.
(2009)
A hybrid GA/SVM approach for gene selection and classification of microarray data
Edmundo Bonilla Huerta;Béatrice Duval;Jin-Kao Hao.
Lecture Notes in Computer Science (2006)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Colorado Boulder
Chinese Academy of Sciences
Nanjing University of Posts and Telecommunications
Fudan University
South China University of Technology
French Institute for Research in Computer Science and Automation - INRIA
University of Strasbourg
University of Coimbra
Lancaster University
Université Paris Cité
University of Utah
University of Southern Denmark
University of Reading
Tohoku University
Royal Netherlands Institute for Sea Research
University of La Laguna
Takeda (Japan)
Cincinnati Children's Hospital Medical Center
Goddard Space Flight Center
Colorado School of Mines
Langley Research Center
University of California, San Diego
Centre for Addiction and Mental Health
Vita-Salute San Raffaele University
Sunnybrook Health Science Centre
University of Trier