Jin-Kao Hao
Orcid: 0000-0001-8813-4377Affiliations:
- University of Angers, France
According to our database1,
Jin-Kao Hao
authored at least 314 papers
between 1990 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Networks, March, 2024
Global optimization and structural analysis of Coulomb and logarithmic potentials on the unit sphere using a population-based heuristic approach.
Expert Syst. Appl., March, 2024
Eur. J. Oper. Res., March, 2024
A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment.
Eur. J. Oper. Res., January, 2024
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem.
CoRR, 2024
Learning-guided iterated local search for the minmax multiple traveling salesman problem.
CoRR, 2024
Deinterleaving of Discrete Renewal Process Mixtures with Application to Electronic Support Measures.
CoRR, 2024
2023
Networks, October, 2023
Learning-based multi-start iterated local search for the profit maximization set covering problem.
Inf. Sci., October, 2023
A massively parallel evolutionary algorithm for the partial Latin square extension problem.
Comput. Oper. Res., October, 2023
Expert Syst. Appl., September, 2023
Expert Syst. Appl., August, 2023
A fast tri-individual memetic search approach for the distance-based critical node problem.
Eur. J. Oper. Res., July, 2023
Memetic search for the minmax multiple traveling salesman problem with single and multiple depots.
Eur. J. Oper. Res., June, 2023
Solving the Single-Row Facility Layout Problem by K-Medoids Memetic Permutation Group.
IEEE Trans. Evol. Comput., April, 2023
General Edge Assembly Crossover-Driven Memetic Search for Split Delivery Vehicle Routing.
Transp. Sci., March, 2023
PeerJ Comput. Sci., 2023
A double-decomposition based parallel exact algorithm for the feedback length minimization problem.
PeerJ Comput. Sci., 2023
Expert Syst. Appl., 2023
Responsive strategic oscillation for solving the disjunctively constrained knapsack problem.
Eur. J. Oper. Res., 2023
An effective hybrid search algorithm for the multiple traveling repairman problem with profits.
Eur. J. Oper. Res., 2023
CoRR, 2023
Multi-wave tabu search for the boolean quadratic programming problem with generalized upper bound constraints.
Comput. Oper. Res., 2023
Comput. Oper. Res., 2023
A One-Vs-One Approach to Improve Tangled Program Graph Performance on Classification Tasks.
Proceedings of the 15th International Joint Conference on Computational Intelligence, 2023
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2023
Monte Carlo Tree Search with Adaptive Simulation: A Case Study on Weighted Vertex Coloring.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2023
2022
IEEE Trans. Syst. Man Cybern. Syst., 2022
IEEE Trans. Cybern., 2022
IEEE Trans. Computers, 2022
IEEE Trans Autom. Sci. Eng., 2022
Solving the clustered traveling salesman problem <i>via</i> traveling salesman problem methods.
PeerJ Comput. Sci., 2022
Knowl. Based Syst., 2022
Knowl. Based Syst., 2022
Intensification-driven local search for the traveling repairman problem with profits.
Expert Syst. Appl., 2022
Eur. J. Oper. Res., 2022
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem.
Eur. J. Oper. Res., 2022
Eur. J. Oper. Res., 2022
Iterated dynamic thresholding search for packing equal circles into a circular container.
Eur. J. Oper. Res., 2022
Hybrid search with neighborhood reduction for the multiple traveling salesman problem.
Comput. Oper. Res., 2022
Appl. Soft Comput., 2022
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2022
2021
IEEE Trans. Evol. Comput., 2021
Knowl. Based Syst., 2021
Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering.
Inf. Sci., 2021
Iterated multilevel simulated annealing for large-scale graph conductance minimization.
Inf. Sci., 2021
Expert Syst. Appl., 2021
Expert Syst. Appl., 2021
User project planning in social and medico-social sector: Models and solution methods.
Expert Syst. Appl., 2021
Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping.
Eur. J. Oper. Res., 2021
Eng. Appl. Artif. Intell., 2021
CoRR, 2021
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem.
Comput. Oper. Res., 2021
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering.
Comput. Oper. Res., 2021
Comput. Oper. Res., 2021
Parallel iterative solution-based tabu search for the obnoxious <i>p</i>-median problem.
Comput. Oper. Res., 2021
Appl. Soft Comput., 2021
Proceedings of the IEEE Symposium on Computers and Communications, 2021
2020
Knowl. Based Syst., 2020
Future Gener. Comput. Syst., 2020
Expert Syst. Appl., 2020
A study of two evolutionary/tabu search approaches for the generalized max-mean dispersion problem.
Expert Syst. Appl., 2020
Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem.
Expert Syst. Appl., 2020
General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem.
Comput. Oper. Res., 2020
Appl. Soft Comput., 2020
2019
IEEE Trans. Evol. Comput., 2019
IEEE Trans. Cybern., 2019
Knowl. Based Syst., 2019
Inf. Sci., 2019
J. Heuristics, 2019
Future Gener. Comput. Syst., 2019
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem.
Eur. J. Oper. Res., 2019
Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs.
Eng. Appl. Artif. Intell., 2019
Eng. Appl. Artif. Intell., 2019
Gradient Descent based Weight Learning for Grouping Problems: Application on Graph Coloring and Equitable Graph Coloring.
CoRR, 2019
Multiple phase tabu search for bipartite boolean quadratic programming with partitioned variables.
Comput. Oper. Res., 2019
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem.
Comput. Oper. Res., 2019
Comput. Oper. Res., 2019
IEEE Access, 2019
Proceedings of the Artificial Evolution, 2019
2018
Inf. Sci., 2018
Inf. Sci., 2018
A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem.
Inf. Sci., 2018
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs.
Eur. J. Oper. Res., 2018
Eur. J. Oper. Res., 2018
Eng. Appl. Artif. Intell., 2018
Appl. Soft Comput., 2018
Appl. Soft Comput., 2018
A Diversification-based Quantum Particle Swarm Optimization Algorithm for the Multidimensional Knapsack Problem.
Proceedings of the 5th IEEE International Conference on Cloud Computing and Intelligence Systems, 2018
Proceedings of the 5th IEEE International Conference on Cloud Computing and Intelligence Systems, 2018
2017
IEEE Trans. Evol. Comput., 2017
Math. Program. Comput., 2017
Knowl. Based Syst., 2017
Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs.
Knowl. Based Syst., 2017
Expert Syst. Appl., 2017
Eur. J. Oper. Res., 2017
When data mining meets optimization: A case study on the quadratic assignment problem.
CoRR, 2017
CoRR, 2017
Combining tabu search and graph reduction to solve the maximum balanced biclique problem.
CoRR, 2017
Comput. Oper. Res., 2017
Comput. Oper. Res., 2017
Comput. Oper. Res., 2017
Ann. Oper. Res., 2017
Proceedings of the Genetic and Evolutionary Computation Conference, 2017
Proceedings of the Genetic and Evolutionary Computation Conference, 2017
2016
IEEE Trans. Evol. Comput., 2016
RAIRO Oper. Res., 2016
Knowl. Based Syst., 2016
Knowl. Based Syst., 2016
J. Comb. Optim., 2016
J. Comb. Optim., 2016
A clique-based exact method for optimal winner determination in combinatorial auctions.
Inf. Sci., 2016
Inf. Sci., 2016
Reinforcement learning based local search for grouping problems: A case study on graph coloring.
Expert Syst. Appl., 2016
Eur. J. Oper. Res., 2016
Eur. J. Oper. Res., 2016
Eng. Appl. Artif. Intell., 2016
Eng. Appl. Artif. Intell., 2016
Comput. Oper. Res., 2016
Ann. Oper. Res., 2016
2015
IEEE Trans. Syst. Man Cybern. Syst., 2015
Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints.
INFORMS J. Comput., 2015
Expert Syst. Appl., 2015
Expert Syst. Appl., 2015
Expert Syst. Appl., 2015
Eng. Appl. Artif. Intell., 2015
General swap-based multiple neighborhood tabu search for the maximum independent set problem.
Eng. Appl. Artif. Intell., 2015
Eng. Appl. Artif. Intell., 2015
Ann. Oper. Res., 2015
A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015
Experiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2015
Proceedings of the Artificial Evolution, 2015
2014
J. Comb. Optim., 2014
A memetic algorithm for discovering negative correlation biclusters of DNA microarray data.
Neurocomputing, 2014
Breakout local search for the Steiner tree problem with revenue, budget and hop constraints.
Eur. J. Oper. Res., 2014
A "reduce and solve" approach for the multiple-choice multidimensional knapsack problem.
Eur. J. Oper. Res., 2014
Eng. Appl. Artif. Intell., 2014
CoRR, 2014
In silico evaluation of the influence of the translocon on partitioning of membrane segments.
BMC Bioinform., 2014
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming.
Appl. Soft Comput., 2014
Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014
2013
Proceedings of the Hybrid Metaheuristics, 2013
Proceedings of the Handbook of Optimization - From Classical to Modern Approach, 2013
J. Comb. Optim., 2013
Eur. J. Oper. Res., 2013
Comput. Oper. Res., 2013
NARROMI: a noise and redundancy reduction technique improves accuracy of gene regulatory network inference.
Bioinform., 2013
Appl. Soft Comput., 2013
Asia Pac. J. Oper. Res., 2013
Appl. Math. Comput., 2013
Proceedings of the IJCAI 2013, 2013
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013
Proceedings of the Evolutionary Multi-Criterion Optimization, 2013
Proceedings of the Artificial Evolution, 2013
Improving the Louvain Algorithm for Community Detection with Modularity Maximization.
Proceedings of the Artificial Evolution, 2013
2012
Proceedings of the Handbook of Memetic Algorithms, 2012
BiMine+: An efficient algorithm for discovering relevant biclusters of DNA microarray data.
Knowl. Based Syst., 2012
Knowl. Inf. Syst., 2012
Eur. J. Oper. Res., 2012
Discret. Appl. Math., 2012
Comput. Oper. Res., 2012
BMC Bioinform., 2012
BMC Bioinform., 2012
Inferring gene regulatory networks from gene expression data by path consistency algorithm based on conditional mutual information.
Bioinform., 2012
Ann. Oper. Res., 2012
Proceedings of the Simulated Evolution and Learning - 9th International Conference, 2012
Proceedings of the Pattern Recognition in Bioinformatics, 2012
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012
2011
IEEE Trans. Evol. Comput., 2011
J. Heuristics, 2011
Eur. J. Oper. Res., 2011
Discret. Appl. Math., 2011
Comput. Oper. Res., 2011
Comput. Optim. Appl., 2011
Ann. Oper. Res., 2011
Hybrid Filter-Wrapper with a Specialized Random Multi-Parent Crossover Operator for Gene Selection and Classification Problems.
Proceedings of the Bio-Inspired Computing and Applications, 2011
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011
Multi-Neighborhood Search for Discrimination of Signal Peptides and Transmembrane Segments.
Proceedings of the Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics, 2011
2010
A hybrid LDA and genetic algorithm for gene selection and classification of microarray data.
Neurocomputing, 2010
Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems.
Int. J. Metaheuristics, 2010
Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems.
Int. J. Metaheuristics, 2010
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition.
Int. J. Appl. Metaheuristic Comput., 2010
Int. J. Appl. Metaheuristic Comput., 2010
Eur. J. Oper. Res., 2010
An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring.
Comput. Oper. Res., 2010
Comput. Oper. Res., 2010
Comput. Ind. Eng., 2010
Briefings Bioinform., 2010
4OR, 2010
Proceedings of the Pattern Recognition in Bioinformatics, 2010
Proceedings of the Parallel Problem Solving from Nature, 2010
Proceedings of the Trends in Applied Intelligent Systems, 2010
Proceedings of the Trends in Applied Intelligent Systems, 2010
Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010
A Local Search Appproach for Transmembrane Segment and Signal Peptide Discrimination.
Proceedings of the Evolutionary Computation, 2010
2009
Int. J. Math. Oper. Res., 2009
Comput. Ind. Eng., 2009
A biclustering algorithm based on a Bicluster Enumeration Tree: application to DNA microarray data.
BioData Min., 2009
Proceedings of the Learning and Intelligent Optimization, Third International Conference, 2009
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
Proceedings of the Evolutionary Computation, 2009
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2009
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2009
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2009
2008
IEEE ACM Trans. Comput. Biol. Bioinform., 2008
Genom. Proteom. Bioinform., 2008
Eur. J. Oper. Res., 2008
Using solution properties within an enumerative search to solve a sports league scheduling problem.
Discret. Appl. Math., 2008
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem.
Comput. Oper. Res., 2008
Proceedings of the Pattern Recognition in Bioinformatics, 2008
Proceedings of the Modelling, 2008
Proceedings of the New Frontiers in Applied Artificial Intelligence, 2008
Proceedings of the Bioinformatics Research and Development, 2008
Proceedings of the Artificial Intelligence: Methodology, 2008
2007
Simultaneous vehicle and driver scheduling: A case study in a limousine rental company.
Comput. Ind. Eng., 2007
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
A Genetic Embedded Approach for Gene Selection and Classification of Microarray Data.
Proceedings of the Evolutionary Computation, 2007
Proceedings of the Combinatorial Optimization and Applications, 2007
Proceedings of the Artificial Evolution, 2007
Proceedings of the Artificial Evolution, 2007
Proceedings of the 2007 IEEE International Conference on Services Computing, 2007
2006
Evol. Comput., 2006
Proceedings of the Semantic Web Services, Processes and Applications, 2006
A Distance-Based Information Preservation Tree Crossover for the Maximum Parsimony Problem.
Proceedings of the Parallel Problem Solving from Nature, 2006
Proceedings of the MICAI 2006: Advances in Artificial Intelligence, 2006
Proceedings of the Applications of Evolutionary Computing, 2006
Proceedings of the Principles and Practice of Constraint Programming, 2006
2005
Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes.
RAIRO Oper. Res., 2005
Proceedings of the Operations Research Proceedings 2005, 2005
Proceedings of the MICAI 2005: Advances in Artificial Intelligence, 2005
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
Proceedings of the ICWS 2005 Second International Workshop on Semantic and Dynamic Web Processes, 2005
Proceedings of the Advances in Natural Computation, First International Conference, 2005
Approaches of Web Services Composition - Comparison between BPEL4WS and OWL-S.
Proceedings of the ICEIS 2005, 2005
Proceedings of the Artificial Evolution, 2005
2004
J. Math. Model. Algorithms, 2004
A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of SPLib).
Discret. Appl. Math., 2004
Proceedings of the Parallel Problem Solving from Nature, 2004
Recherche locale dichotomique pour la résolution des CSP continus.
Proceedings of the Programmation en logique avec contraintes, 2004
2003
Tech. Sci. Informatiques, 2003
J. Comb. Optim., 2003
Proceedings of the Personal Wireless Communications, IFIP-TC6 8th International Conference, 2003
Proceedings of the Applications of Evolutionary Computing, 2003
Proceedings of the Evolutionary Multi-Criterion Optimization, 2003
Proceedings of the Artificial Evolution, 2003
Proceedings of the Artificial Evolution, 2003
2002
Rev. d'Intelligence Artif., 2002
Proceedings of the Parallel Problem Solving from Nature, 2002
2001
RAIRO Oper. Res., 2001
J. Heuristics, 2001
A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite.
Comput. Optim. Appl., 2001
A Hybrid Approach for the 01 Multidimensional Knapsack problem.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001
Proceedings of the Artificial Evolution, 2001
2000
An Analysis of the Configuration Space of the Maximal Constraint Satisfaction Problem.
Proceedings of the Parallel Problem Solving from Nature, 2000
Proceedings of the Local Search for Planning and Scheduling, 2000
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000
1999
Proceedings of the Artificial Evolution, 4th European Conference, 1999
1998
Proceedings of the Parallel Problem Solving from Nature, 1998
1997
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997
1996
Constraint Handling in Evolutionary Search: A Case Study of the Frequency Assignment.
Proceedings of the Parallel Problem Solving from Nature, 1996
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996
1995
A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems.
Proceedings of the Artificial Neural Nets and Genetic Algorithms, 1995
Proceedings of the Artificial Evolution, European Conference, 1995
1994
Proceedings of the First IEEE Conference on Evolutionary Computation, 1994
A New Population-Based Method for Satisfiability Problems.
Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994
1992
Proceedings of the SEKE'92, 1992
1991
Proceedings of the 19th annual conference on Computer Science, 1991
1990
Combining Partial Evaluation and Constraint Solving: A new approach to Constraint Logic Programming.
Proceedings of the SPLT'90, 1990