


Остановите войну!
for scientists:


default search action
Jin-Kao Hao
Person information

- affiliation: University of Angers, France
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j194]Zhen Shang, Jin-Kao Hao
, Songzheng Zhao, Yang Wang, Fei Ma:
Multi-wave tabu search for the boolean quadratic programming problem with generalized upper bound constraints. Comput. Oper. Res. 150: 106077 (2023) - [j193]Xiangjing Lai, Dong Yue, Jin-Kao Hao
, Fred W. Glover, Zhipeng Lü:
Iterated dynamic neighborhood search for packing equal circles on a sphere. Comput. Oper. Res. 151: 106121 (2023) - [j192]Olivier Goudet
, Jin-Kao Hao
:
A massively parallel evolutionary algorithm for the partial Latin square extension problem. Comput. Oper. Res. 158: 106284 (2023) - [j191]Jintong Ren, Jin-Kao Hao
, Feng Wu, Zhang-Hua Fu
:
An effective hybrid search algorithm for the multiple traveling repairman problem with profits. Eur. J. Oper. Res. 304(2): 381-394 (2023) - [j190]Pengfei He, Jin-Kao Hao
:
Memetic search for the minmax multiple traveling salesman problem with single and multiple depots. Eur. J. Oper. Res. 307(3): 1055-1070 (2023) - [j189]Yangming Zhou
, Gezi Wang
, Jin-Kao Hao, Na Geng
, Zhibin Jiang:
A fast tri-individual memetic search approach for the distance-based critical node problem. Eur. J. Oper. Res. 308(2): 540-554 (2023) - [j188]Zequn Wei
, Jin-Kao Hao
, Jintong Ren, Fred W. Glover
:
Responsive strategic oscillation for solving the disjunctively constrained knapsack problem. Eur. J. Oper. Res. 309(3): 993-1009 (2023) - [j187]Zequn Wei
, Jin-Kao Hao
:
Iterated hyperplane search for the budgeted maximum coverage problem. Expert Syst. Appl. 214: 119078 (2023) - [j186]Zhi Lu
, Anna Martínez-Gavara
, Jin-Kao Hao
, Xiangjing Lai
:
Solution-based tabu search for the capacitated dispersion problem. Expert Syst. Appl. 223: 119856 (2023) - [j185]Yuji Zou, Jin-Kao Hao
, Qinghua Wu:
Breakout local search for the traveling salesman problem with job-times. Expert Syst. Appl. 225: 120020 (2023) - [j184]Wen Sun, Wenlong Li, Jin-Kao Hao, Qinghua Wu:
Learning-based multi-start iterated local search for the profit maximization set covering problem. Inf. Sci. 646: 119404 (2023) - [j183]Wen Sun, Jin-Kao Hao
, Zihao Wu, Wenlong Li, Qinghua Wu:
Dynamic thresholding search for the feedback vertex set problem. PeerJ Comput. Sci. 9: e1245 (2023) - [j182]Lixin Tang
, Zuocheng Li
, Jin-Kao Hao
:
Solving the Single-Row Facility Layout Problem by K-Medoids Memetic Permutation Group. IEEE Trans. Evol. Comput. 27(2): 251-265 (2023) - [c91]Jean Pinsolle, Olivier Goudet
, Cyrille Enderli, Jin-Kao Hao
:
A Memetic Algorithm for Deinterleaving Pulse Trains. EvoCOP 2023: 66-81 - [c90]Cyril Grelier
, Olivier Goudet
, Jin-Kao Hao
:
Monte Carlo Tree Search with Adaptive Simulation: A Case Study on Weighted Vertex Coloring. EvoCOP 2023: 98-113 - [i31]Cyril Grelier, Olivier Goudet, Jin-Kao Hao:
Combining Monte Carlo Tree Search and Heuristic Search for Weighted Vertex Coloring. CoRR abs/2304.12146 (2023) - [i30]Zhen Shang, Jin-Kao Hao, Fei Ma:
A double-decomposition based parallel exact algorithm for the feedback length minimization problem. CoRR abs/2309.00811 (2023) - 2022
- [j181]Yinuo Li, Jin-Kao Hao
:
Multi-neighborhood simulated annealing for personalized user project planning. Appl. Soft Comput. 119: 108566 (2022) - [j180]Pengfei He, Jin-Kao Hao
:
Hybrid search with neighborhood reduction for the multiple traveling salesman problem. Comput. Oper. Res. 142: 105726 (2022) - [j179]Qing Zhou, Jin-Kao Hao
, Qinghua Wu:
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem. Eur. J. Oper. Res. 296(3): 788-803 (2022) - [j178]Yi Zhou
, Weibo Lin, Jin-Kao Hao
, Mingyu Xiao, Yan Jin:
An effective branch-and-bound algorithm for the maximum s-bundle problem. Eur. J. Oper. Res. 297(1): 27-39 (2022) - [j177]Xiangjing Lai, Jin-Kao Hao
, Dong Yue, Zhipeng Lü, Zhang-Hua Fu
:
Iterated dynamic thresholding search for packing equal circles into a circular container. Eur. J. Oper. Res. 299(1): 137-153 (2022) - [j176]Mingjie Li, Jin-Kao Hao
, Qinghua Wu:
Learning-driven feasible and infeasible tabu search for airport gate assignment. Eur. J. Oper. Res. 302(1): 172-186 (2022) - [j175]Jintong Ren, Jin-Kao Hao
, Feng Wu
, Zhang-Hua Fu
:
Intensification-driven local search for the traveling repairman problem with profits. Expert Syst. Appl. 202: 117072 (2022) - [j174]Olivier Goudet
, Cyril Grelier
, Jin-Kao Hao
:
A deep learning guided memetic framework for graph coloring problems. Knowl. Based Syst. 258: 109986 (2022) - [j173]Wen Sun, Jin-Kao Hao
, Wenlong Li, Qinghua Wu:
An adaptive memetic algorithm for the bidirectional loop layout problem. Knowl. Based Syst. 258: 110002 (2022) - [j172]Yongliang Lu, Jin-Kao Hao
, Qinghua Wu:
Solving the clustered traveling salesman problem via traveling salesman problem methods. PeerJ Comput. Sci. 8: e972 (2022) - [j171]Zuocheng Li
, Lixin Tang
, Jin-Kao Hao:
Dual Probability Learning Based Local Search for the Task Assignment Problem. IEEE Trans Autom. Sci. Eng. 19(1): 332-347 (2022) - [j170]Yan Jin
, Bowen Xiong
, Kun He
, Jin-Kao Hao
, Chu-Min Li, Zhang-Hua Fu
:
Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization. IEEE Trans. Computers 71(10): 2370-2380 (2022) - [j169]Zhi Lu
, Yi Zhou
, Jin-Kao Hao
:
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem. IEEE Trans. Cybern. 52(9): 9391-9403 (2022) - [j168]Yangming Zhou
, Jin-Kao Hao
, Béatrice Duval:
Frequent Pattern-Based Search: A Case Study on the Quadratic Assignment Problem. IEEE Trans. Syst. Man Cybern. Syst. 52(3): 1503-1515 (2022) - [c89]Cyril Grelier
, Olivier Goudet
, Jin-Kao Hao:
On Monte Carlo Tree Search for Weighted Vertex Coloring. EvoCOP 2022: 1-16 - [i29]Yangming Zhou, Jin-Kao Hao, Zhen Li, Fred W. Glover:
Heuristic Search for Rank Aggregation with Application to Label Ranking. CoRR abs/2201.03893 (2022) - [i28]Cyril Grelier, Olivier Goudet, Jin-Kao Hao:
On Monte Carlo Tree Search for Weighted Vertex Coloring. CoRR abs/2202.01665 (2022) - 2021
- [j167]Wen Sun, Jin-Kao Hao, Yuhao Zang
, Xiangjing Lai:
A solution-driven multilevel approach for graph coloring. Appl. Soft Comput. 104: 107174 (2021) - [j166]Zequn Wei
, Jin-Kao Hao:
Multistart solution-based tabu search for the Set-Union Knapsack Problem. Appl. Soft Comput. 105: 107260 (2021) - [j165]Xiaoyu Chen, Yi Zhou
, Jin-Kao Hao
, Mingyu Xiao
:
Computing maximum k-defective cliques in massive graphs. Comput. Oper. Res. 127: 105131 (2021) - [j164]Jian Chang, Lifang Wang, Jin-Kao Hao
, Yang Wang:
Parallel iterative solution-based tabu search for the obnoxious p-median problem. Comput. Oper. Res. 127: 105155 (2021) - [j163]Xiangjing Lai, Jin-Kao Hao, Zhang-Hua Fu, Dong Yue:
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering. Comput. Oper. Res. 134: 105362 (2021) - [j162]Zequn Wei
, Jin-Kao Hao:
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem. Comput. Oper. Res. 136: 105447 (2021) - [j161]Pengfei He, Jin-Kao Hao:
Iterated two-phase local search for the colored traveling salesmen problem. Eng. Appl. Artif. Intell. 97: 104018 (2021) - [j160]Xiangjing Lai, Jin-Kao Hao
, Zhang-Hua Fu, Dong Yue:
Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping. Eur. J. Oper. Res. 289(3): 1067-1086 (2021) - [j159]Zequn Wei
, Jin-Kao Hao:
Kernel based tabu search for the Set-union Knapsack Problem. Expert Syst. Appl. 165: 113802 (2021) - [j158]Yinuo Li, Jin-Kao Hao, Brahim Chabane:
User project planning in social and medico-social sector: Models and solution methods. Expert Syst. Appl. 173: 114684 (2021) - [j157]Liwen Li, Zequn Wei
, Jin-Kao Hao, Kun He:
Probability learning based tabu search for the budgeted maximum coverage problem. Expert Syst. Appl. 183: 115310 (2021) - [j156]Qing Zhou, Jin-Kao Hao, Qinghua Wu:
Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering. Inf. Sci. 569: 184-204 (2021) - [j155]Pengfei He, Jin-Kao Hao, Qinghua Wu:
Grouping memetic search for the colored traveling salesmen problem. Inf. Sci. 570: 689-707 (2021) - [j154]Zhi Lu
, Jin-Kao Hao, Una Benlic, David Lesaint:
Iterated multilevel simulated annealing for large-scale graph conductance minimization. Inf. Sci. 572: 182-199 (2021) - [j153]Olivier Goudet
, Béatrice Duval, Jin-Kao Hao:
Population-based gradient descent weight learning for graph coloring problems. Knowl. Based Syst. 212: 106581 (2021) - [j152]Yangming Zhou
, Jin-Kao Hao
, Zhang-Hua Fu
, Zhe Wang
, Xiangjing Lai
:
Variable Population Memetic Search: A Case Study on the Critical Node Problem. IEEE Trans. Evol. Comput. 25(1): 187-200 (2021) - [c88]Yinuo Li, Touria Ait El Mekki, Jin-Kao Hao:
Adverse Event Report Classification in Social and Medico-Social Sector. ISCC 2021: 1-6 - [i27]Zequn Wei, Jin-Kao Hao:
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem. CoRR abs/2101.04753 (2021) - [i26]Olivier Goudet, Jin-Kao Hao:
Massively parallel hybrid search for the partial Latin square extension problem. CoRR abs/2103.10453 (2021) - [i25]Olivier Goudet, Cyril Grelier, Jin-Kao Hao:
A deep learning guided memetic framework for graph coloring problems. CoRR abs/2109.05948 (2021) - [i24]Jintong Ren, Jin-Kao Hao, Feng Wu, Zhang-Hua Fu:
An effective hybrid search algorithm for the multiple traveling repairman problem with profits. CoRR abs/2111.05017 (2021) - 2020
- [j151]Qing Zhou, Jin-Kao Hao
, Zhe Sun, Qinghua Wu
:
Memetic search for composing medical crews with equity and efficiency. Appl. Soft Comput. 94: 106440 (2020) - [j150]Mingjie Li, Jin-Kao Hao
, Qinghua Wu
:
General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem. Comput. Oper. Res. 119: 104922 (2020) - [j149]Xiangjing Lai, Jin-Kao Hao
, Fred W. Glover
:
A study of two evolutionary/tabu search approaches for the generalized max-mean dispersion problem. Expert Syst. Appl. 139 (2020) - [j148]Xiangjing Lai, Jin-Kao Hao
, Zhang-Hua Fu, Dong Yue:
Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem. Expert Syst. Appl. 149: 113310 (2020) - [j147]Ji Lu, Yuning Chen
, Jin-Kao Hao, Renjie He:
The Time-dependent Electric Vehicle Routing Problem: Model and solution. Expert Syst. Appl. 161: 113593 (2020) - [j146]Zhi Lu
, Jin-Kao Hao, Qinghua Wu:
A hybrid evolutionary algorithm for finding low conductance of large graphs. Future Gener. Comput. Syst. 106: 105-120 (2020) - [j145]Daniel Porumbel
, Jin-Kao Hao:
Distance-guided local search. J. Heuristics 26(5): 711-741 (2020) - [j144]Wen Sun, Jin-Kao Hao, Wenyu Wang
, Qinghua Wu:
Memetic search for the equitable coloring problem. Knowl. Based Syst. 188 (2020) - [j143]Jintong Ren, Jin-Kao Hao, Eduardo Rodriguez-Tello, Liwen Li, Kun He:
A new iterated local search algorithm for the cyclic bandwidth problem. Knowl. Based Syst. 203: 106136 (2020) - [i23]Yongliang Lu, Jin-Kao Hao, Qinghua Wu:
Solving the Clustered Traveling Salesman Problem via TSP methods. CoRR abs/2007.05254 (2020) - [i22]Liwen Li, Zequn Wei, Jin-Kao Hao, Kun He:
Probability Learning based Tabu Search for the Budgeted Maximum Coverage Problem. CoRR abs/2007.05971 (2020)
2010 – 2019
- 2019
- [j142]Jintong Ren, Jin-Kao Hao
, Eduardo Rodriguez-Tello
:
An Iterated Three-Phase Search Approach for Solving the Cyclic Bandwidth Problem. IEEE Access 7: 98436-98452 (2019) - [j141]Zhen Shang, Songzheng Zhao, Jin-Kao Hao
, Xue Yang, Fuda Ma:
Multiple phase tabu search for bipartite boolean quadratic programming with partitioned variables. Comput. Oper. Res. 102: 141-149 (2019) - [j140]Brahim Chabane, Matthieu Basseur, Jin-Kao Hao
:
Lorenz dominance based algorithms to solve a practical multiobjective problem. Comput. Oper. Res. 104: 1-14 (2019) - [j139]Zhi Lu
, Jin-Kao Hao
, Yi Zhou
:
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem. Comput. Oper. Res. 111: 43-57 (2019) - [j138]Yi Zhou
, Jin-Kao Hao:
Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs. Eng. Appl. Artif. Intell. 77: 86-97 (2019) - [j137]Yuning Chen, Jin-Kao Hao:
Dynamic thresholding search for minimum vertex cover in massive sparse graphs. Eng. Appl. Artif. Intell. 82: 76-84 (2019) - [j136]Qing Zhou, Una Benlic, Qinghua Wu, Jin-Kao Hao
:
Heuristic search to the capacitated clustering problem. Eur. J. Oper. Res. 273(2): 464-487 (2019) - [j135]Xiangjing Lai, Jin-Kao Hao
, Dong Yue:
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem. Eur. J. Oper. Res. 274(1): 35-48 (2019) - [j134]Zequn Wei
, Jin-Kao Hao:
Iterated two-phase local search for the Set-Union Knapsack Problem. Future Gener. Comput. Syst. 101: 1005-1017 (2019) - [j133]Fred W. Glover
, Jin-Kao Hao
:
Diversification-based learning in computing and optimization. J. Heuristics 25(4-5): 521-537 (2019) - [j132]Wen Sun, Jin-Kao Hao
, Alexandre Caminada:
Iterated backtrack removal search for finding k-vertex-critical subgraphs. J. Heuristics 25(4-5): 565-590 (2019) - [j131]Yongliang Lu, Jin-Kao Hao, Qinghua Wu:
Hybrid evolutionary search for the traveling repairman problem with profits. Inf. Sci. 502: 91-108 (2019) - [j130]Xiangjing Lai, Jin-Kao Hao, Fred W. Glover
, Dong Yue:
Intensification-driven tabu search for the minimum differential dispersion problem. Knowl. Based Syst. 167: 68-86 (2019) - [j129]Yangming Zhou
, Jin-Kao Hao
, Fred W. Glover:
Memetic Search for Identifying Critical Nodes in Sparse Graphs. IEEE Trans. Cybern. 49(10): 3699-3712 (2019) - [j128]Yan Jin, Jin-Kao Hao
:
Solving the Latin Square Completion Problem by Memetic Graph Coloring. IEEE Trans. Evol. Comput. 23(6): 1015-1028 (2019) - [c87]Jintong Ren, Jin-Kao Hao, Eduardo Rodriguez-Tello:
A Study of Recombination Operators for the Cyclic Bandwidth Problem. EA 2019: 177-191 - [i21]Zequn Wei, Jin-Kao Hao:
Iterated two-phase local search for the Set-Union Knapsack Problem. CoRR abs/1903.04966 (2019) - [i20]Olivier Goudet, Béatrice Duval, Jin-Kao Hao:
Gradient Descent based Weight Learning for Grouping Problems: Application on Graph Coloring and Equitable Graph Coloring. CoRR abs/1909.02261 (2019) - [i19]Yangming Zhou, Jin-Kao Hao, Zhang-Hua Fu, Zhe Wang, Xiangjing Lai:
Variable Population Memetic Search: A Case Study on the Critical Node Problem. CoRR abs/1909.08691 (2019) - 2018
- [j127]Qinghua Wu, Qing Zhou, Yan Jin, Jin-Kao Hao:
Minimum sum coloring for large graphs with extraction and backward expansion search. Appl. Soft Comput. 62: 1056-1065 (2018) - [j126]Yangming Zhou
, Béatrice Duval, Jin-Kao Hao
:
Improving probability learning based local search for graph coloring. Appl. Soft Comput. 65: 542-553 (2018) - [j125]Wenyu Wang
, Jin-Kao Hao, Qinghua Wu:
Tabu search with feasible and infeasible searches for equitable coloring. Eng. Appl. Artif. Intell. 71: 1-14 (2018) - [j124]Yuning Chen, Jin-Kao Hao
:
Two phased hybrid local search for the periodic capacitated arc routing problem. Eur. J. Oper. Res. 264(1): 55-65 (2018) - [j123]Yi Zhou
, André Rossi
, Jin-Kao Hao
:
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs. Eur. J. Oper. Res. 269(3): 834-843 (2018) - [j122]Xiangjing Lai, Jin-Kao Hao
, Fred W. Glover, Zhipeng Lü:
A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem. Inf. Sci. 436-437: 282-301 (2018) - [j121]Xiangjing Lai, Dong Yue, Jin-Kao Hao
, Fred W. Glover:
Solution-based tabu search for the maximum min-sum dispersion problem. Inf. Sci. 441: 79-94 (2018) - [j120]Wen Sun, Jin-Kao Hao
, Xiangjing Lai, Qinghua Wu:
Adaptive feasible and infeasible tabu search for weighted vertex coloring. Inf. Sci. 466: 203-219 (2018) - [c86]Xiangjing Lai, Jin-Kao Hao, Dong Yue, Hao Gao:
Diversification-driven Memetic Algorithm for the Maximum Diversity Problem. CCIS 2018: 310-314 - [c85]Xiangjing Lai, Jin-Kao Hao, Dong Yue, Hao Gao:
A Diversification-based Quantum Particle Swarm Optimization Algorithm for the Multidimensional Knapsack Problem. CCIS 2018: 315-319 - 2017
- [j119]Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao:
Algorithms for the minimum sum coloring problem: a review. Artif. Intell. Rev. 47(3): 367-394 (2017) - [j118]Fuda Ma, Jin-Kao Hao:
A multiple search operator heuristic for the max-k-cut problem. Ann. Oper. Res. 248(1-2): 365-403 (2017) - [j117]Yuning Chen, Jin-Kao Hao:
An iterated "hyperplane exploration" approach for the quadratic knapsack problem. Comput. Oper. Res. 77: 226-239 (2017) - [j116]Fuda Ma, Jin-Kao Hao
, Yang Wang:
An effective iterated tabu search for the maximum bisection problem. Comput. Oper. Res. 81: 78-89 (2017) - [j115]Yi Zhou
, Jin-Kao Hao:
Frequency-driven tabu search for the maximum s-plex problem. Comput. Oper. Res. 86: 65-78 (2017) - [j114]Yi Zhou
, Jin-Kao Hao
, Adrien Goëffon:
PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem. Eur. J. Oper. Res. 257(1): 41-54 (2017) - [j113]Brahim Chabane, Matthieu Basseur, Jin-Kao Hao
:
R2-IBMOLS applied to a practical case of the multiobjective knapsack problem. Expert Syst. Appl. 71: 457-468 (2017) - [j112]Fuda Ma, Yang Wang, Jin-Kao Hao:
Path relinking for the vertex separator problem. Expert Syst. Appl. 82: 332-343 (2017) - [j111]Yangming Zhou
, Jin-Kao Hao:
An iterated local search algorithm for the minimum differential dispersion problem. Knowl. Based Syst. 125: 26-38 (2017) - [j110]Zhang-Hua Fu, Jin-Kao Hao:
Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs. Knowl. Based Syst. 128: 78-92 (2017) - [j109]Zhang-Hua Fu, Jin-Kao Hao:
Swap-vertex based neighborhood for Steiner tree problems. Math. Program. Comput. 9(2): 297-320 (2017) - [j108]Yangming Zhou
, Jin-Kao Hao
, Béatrice Duval:
Opposition-Based Memetic Search for the Maximum Diversity Problem. IEEE Trans. Evol. Comput. 21(5): 731-745 (2017) - [c84]Yangming Zhou
, Jin-Kao Hao:
A fast heuristic algorithm for the critical node problem. GECCO (Companion) 2017: 121-122 - [c83]Wen Sun, Jin-Kao Hao, Xiangjing Lai, Qinghua Wu:
On feasible and infeasible search for equitable graph coloring. GECCO 2017: 369-376 - [i18]Fred W. Glover, Jin-Kao Hao:
Diversification-Based Learning in Computing and Optimization. CoRR abs/1703.07929 (2017) - [i17]Yangming Zhou, Jin-Kao Hao, Fred W. Glover:
Memetic search for identifying critical nodes in sparse graphs. CoRR abs/1705.04119 (2017) - [i16]Yi Zhou, André Rossi, Jin-Kao Hao:
Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem. CoRR abs/1705.07338 (2017) - [i15]Yi Zhou, Jin-Kao Hao:
Combining tabu search and graph reduction to solve the maximum balanced biclique problem. CoRR abs/1705.07339 (2017) - [i14]Yangming Zhou, Jin-Kao Hao, Béatrice Duval:
When data mining meets optimization: A case study on the quadratic assignment problem. CoRR abs/1708.05214 (2017) - 2016
- [j107]Fred W. Glover, Jin-Kao Hao:
f-Flip strategies for unconstrained binary quadratic programming. Ann. Oper. Res. 238(1-2): 651-657 (2016) - [j106]Xiangjing Lai, Jin-Kao Hao:
A tabu search based memetic algorithm for the max-mean dispersion problem. Comput. Oper. Res. 72: 118-127 (2016) - [j105]