default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJin-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
- 2024
[j215]Zhenyu Lei, Jin-Kao Hao
:
An effective memetic algorithm for the close-enough traveling salesman problem. Appl. Soft Comput. 153: 111266 (2024)- [j214]Zhi Lu, Jian Gao, Jin-Kao Hao, Pingle Yang, Lixin Zhou:
Learning driven three-phase search for the maximum independent union of cliques problem. Comput. Oper. Res. 164: 106549 (2024) - [j213]Mingming Zheng, Jin-Kao Hao, Qinghua Wu:
Exact and heuristic solution approaches for the Generalized Independent Set Problem. Comput. Oper. Res. 164: 106561 (2024) - [j212]Olivier Goudet, Adrien Goëffon, Jin-Kao Hao:
A large population island framework for the unconstrained binary quadratic problem. Comput. Oper. Res. 168: 106684 (2024) - [j211]Yuji Zou, Jin-Kao Hao, Qinghua Wu:
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem. Comput. Oper. Res. 170: 106758 (2024) - [j210]Javier Yuste, Eduardo G. Pardo, Abraham Duarte, Jin-Kao Hao:
Multi-objective general variable neighborhood search for software maintainability optimization. Eng. Appl. Artif. Intell. 133: 108593 (2024) - [j209]Mingjie Li, Jin-Kao Hao, Qinghua Wu:
A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment. Eur. J. Oper. Res. 312(2): 473-492 (2024) - [j208]Qinghua Wu, Mu He, Jin-Kao Hao, Yongliang Lu:
An effective hybrid evolutionary algorithm for the clustered orienteering problem. Eur. J. Oper. Res. 313(2): 418-434 (2024) - [j207]Haichao Liu, Yang Wang, Jin-Kao Hao:
Solving the patient admission scheduling problem using constraint aggregation. Eur. J. Oper. Res. 316(1): 85-99 (2024) - [j206]Xiangjing Lai, Jin-Kao Hao, Renbin Xiao, Zhang-Hua Fu:
Global optimization and structural analysis of Coulomb and logarithmic potentials on the unit sphere using a population-based heuristic approach. Expert Syst. Appl. 238(Part A): 121704 (2024) - [j205]Yangming Zhou, Jiaqi Li, Jin-Kao Hao, Fred W. Glover:
Detecting Critical Nodes in Sparse Graphs via "Reduce-Solve-Combine" Memetic Search. INFORMS J. Comput. 36(1): 39-60 (2024) - [j204]Yangming Zhou, Jin-Kao Hao, Zhen Li:
Heuristic Search for Rank Aggregation with Application to Label Ranking. INFORMS J. Comput. 36(2): 308-326 (2024) - [j203]Wen Sun, Chaofan Chen, Jin-Kao Hao, Wenlong Li, Qinghua Wu, Yuning Chen:
A knowledge-based iterated local search for the weighted total domination problem. Inf. Sci. 665: 120364 (2024) - [j202]Qing Zhou, Jin-Kao Hao, Zhong-Zhong Jiang, Qinghua Wu:
An effective hybrid search method for the quadratic knapsack problem with conflict graphs. J. Oper. Res. Soc. 75(5): 1000-1010 (2024) - [j201]Zequn Wei, Jin-Kao Hao, Jintong Ren, Qinghua Wu, Eduardo Rodriguez-Tello:
An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints. Knowl. Based Syst. 302: 112378 (2024) - [j200]Pengfei He, Jin-Kao Hao, Qinghua Wu:
A hybrid genetic algorithm for the Hamiltonian p-median problem. Networks 83(2): 348-367 (2024) - [j199]Yang Wang, Junpeng Wang, Jin-Kao Hao, Jianguang Feng:
Efficient Adaptive Large Neighborhood Search for Sensor-Weapon-Target Assignment. IEEE Trans. Syst. Man Cybern. Syst. 54(10): 6397-6409 (2024) - [c96]He Zheng, Jin-Kao Hao:
Breakout Local Search for Heaviest Subgraph Problem. MIC (1) 2024: 3-8 - [c95]Vorapong Suppakitpaisarn, Jin-Kao Hao:
Utilizing Graph Sparsification for Pre-processing in Max Cut QUBO Solver. MIC (1) 2024: 219-233 - [c94]Cyril Grelier, Olivier Goudet, Jin-Kao Hao:
A Memetic Algorithm with Adaptive Operator Selection for Graph Coloring. EvoStar 2024: 65-80 - [c93]Thibaut Bellanger, Matthieu Le Berre, Manuel Clergue, Jin-Kao Hao:
Directed Acyclic Program Graph Applied to Supervised Classification. GECCO Companion 2024: 1676-1680 - [i37]Vorapong Suppakitpaisarn, Jin-Kao Hao:
Utilizing Graph Sparsification for Pre-processing in Maxcut QUBO Solver. CoRR abs/2401.13004 (2024) - [i36]Jean Pinsolle, Olivier Goudet, Cyrille Enderli, Sylvain Lamprier, Jin-Kao Hao:
Deinterleaving of Discrete Renewal Process Mixtures with Application to Electronic Support Measures. CoRR abs/2402.09166 (2024) - [i35]Pengfei He, Jin-Kao Hao, Qinghua Wu:
A Multi-population Integrated Approach for Capacitated Location Routing. CoRR abs/2403.09361 (2024) - [i34]Pengfei He, Jin-Kao Hao, Jinhui Xia:
Learning-guided iterated local search for the minmax multiple traveling salesman problem. CoRR abs/2403.12389 (2024) - [i33]Yuji Zou, Jin-Kao Hao, Qinghua Wu:
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem. CoRR abs/2403.14405 (2024) - [i32]Xiangjing Lai, Zhenheng Lin, Jin-Kao Hao, Qinghua Wu:
An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem. CoRR abs/2405.16618 (2024) - 2023
- [j198]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) - [j197]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) - [j196]Olivier Goudet, Jin-Kao Hao:
A massively parallel evolutionary algorithm for the partial Latin square extension problem. Comput. Oper. Res. 158: 106284 (2023) - [j195]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) - [j194]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) - [j193]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) - [j192]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) - [j191]Zequn Wei, Jin-Kao Hao:
Iterated hyperplane search for the budgeted maximum coverage problem. Expert Syst. Appl. 214: 119078 (2023) - [j190]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) - [j189]Yuji Zou, Jin-Kao Hao, Qinghua Wu:
Breakout local search for the traveling salesman problem with job-times. Expert Syst. Appl. 225: 120020 (2023) - [j188]Xiangjing Lai, Jin-Kao Hao, Renbin Xiao, Fred W. Glover:
Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres. INFORMS J. Comput. 35(4): 725-746 (2023) - [j187]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) - [j186]Pengfei He, Jin-Kao Hao, Qinghua Wu:
Hybrid genetic algorithm for undirected traveling salesman problems with profits. Networks 82(3): 189-221 (2023) - [j185]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) - [j184]Zhen Shang, Jin-Kao Hao, Fei Ma:
A double-decomposition based parallel exact algorithm for the feedback length minimization problem. PeerJ Comput. Sci. 9: e1597 (2023) - [j183]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) - [j182]Pengfei He, Jin-Kao Hao:
General Edge Assembly Crossover-Driven Memetic Search for Split Delivery Vehicle Routing. Transp. Sci. 57(2): 482-511 (2023) - [c92]Jean Pinsolle, Olivier Goudet, Cyrille Enderli, Jin-Kao Hao:
A Memetic Algorithm for Deinterleaving Pulse Trains. EvoCOP 2023: 66-81 - [c91]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 - [c90]Thibaut Bellanger, Matthieu Le Berre, Manuel Clergue, Jin-Kao Hao:
A One-Vs-One Approach to Improve Tangled Program Graph Performance on Classification Tasks. IJCCI 2023: 53-63 - [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) - [p5]Jin-Kao Hao, Christine Solnon:
Meta-heuristics and Artificial Intelligence. A Guided Tour of Artificial Intelligence Research (2) (II) 2020: 27-52 - [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]Xiangjing Lai, Jin-Kao Hao, Zhipeng Lü, Fred W. Glover:
A learning-based path relinking algorithm for the bandwidth coloring problem. Eng. Appl. Artif. Intell. 52: 81-91 (2016) - [j104]Xiangjing Lai, Jin-Kao Hao:
Iterated variable neighborhood search for the capacitated clustering problem. Eng. Appl. Artif. Intell. 56: 102-120 (2016) - [j103]Yuning Chen, Jin-Kao Hao, Fred W. Glover:
A hybrid metaheuristic approach for the capacitated arc routing problem. Eur. J. Oper. Res. 253(1): 25-39 (2016) - [j102]Xiangjing Lai, Jin-Kao Hao:
Iterated maxima search for the maximally diverse grouping problem. Eur. J. Oper. Res. 254(3): 780-800 (2016) - [j101]Yangming Zhou, Jin-Kao Hao, Béatrice Duval:
Reinforcement learning based local search for grouping problems: A case study on graph coloring. Expert Syst. Appl. 64: 412-422 (2016) - [j100]Qinghua Wu, Jin-Kao Hao:
A clique-based exact method for optimal winner determination in combinatorial auctions. Inf. Sci. 334-335: 103-121 (2016) - [j99]Yan Jin, Jin-Kao Hao:
Hybrid evolutionary search for the minimum sum coloring problem of graphs. Inf. Sci. 352-353: 15-34 (2016) - [j98]Yi Zhou, Jin-Kao Hao, Adrien Goëffon:
A three-phased local search approach for the clique partitioning problem. J. Comb. Optim. 32(2): 469-491 (2016) - [j97]Yang Wang, Jin-Kao Hao, Fred W. Glover, Zhipeng Lü, Qinghua Wu:
Solving the maximum vertex weight clique problem via binary quadratic programming. J. Comb. Optim. 32(2): 531-549 (2016) - [j96]Yuning Chen, Jin-Kao Hao, Fred W. Glover:
An evolutionary path relinking approach for the quadratic multiple knapsack problem. Knowl. Based Syst. 92: 23-34 (2016) - [j95]Yuning Chen, Jin-Kao Hao:
The bi-objective quadratic multiple knapsack problem: Model and heuristics. Knowl. Based Syst. 97: 89-100 (2016) - [j94]Olivier Gach, Jin-Kao Hao:
Combined neighborhood tabu search for community detection in complex networks. RAIRO Oper. Res. 50(2): 269-283 (2016) - [j93]Yuning Chen, Jin-Kao Hao:
Memetic Search for the Generalized Quadratic Multiple Knapsack Problem. IEEE Trans. Evol. Comput. 20(6): 908-923 (2016) - [i13]Yangming Zhou, Jin-Kao Hao, Béatrice Duval:
Reinforcement learning based local search for grouping problems: A case study on graph coloring. CoRR abs/1604.00377 (2016) - [i12]Yangming Zhou, Jin-Kao Hao:
An iterated local search algorithm for the minimum differential dispersion problem. CoRR abs/1608.04217 (2016) - 2015
- [j92]Yuning Chen, Jin-Kao Hao:
Iterated responsive threshold search for the quadratic multiple knapsack problem. Ann. Oper. Res. 226(1): 101-131 (2015) - [j91]Xing-Ming Zhao, Keqin Liu, Guanghui Zhu, Feng He, Béatrice Duval, Jean-Michel Richer, De-Shuang Huang, Changjun Jiang, Jin-Kao Hao, Luonan Chen:
Identifying cancer-related microRNAs based on gene expression data. Bioinform. 31(8): 1226-1234 (2015) - [j90]Yan Jin, Jin-Kao Hao:
General swap-based multiple neighborhood tabu search for the maximum independent set problem. Eng. Appl. Artif. Intell. 37: 20-33 (2015) - [j89]Zhang-Hua Fu, Jin-Kao Hao:
A three-phase search approach for the quadratic minimum spanning tree problem. Eng. Appl. Artif. Intell. 46: 113-130 (2015) - [j88]Xiangjing Lai, Jin-Kao Hao, Fred W. Glover:
Backtracking based iterated tabu search for equitable coloring. Eng. Appl. Artif. Intell. 46: 269-278 (2015) - [j87]Qinghua Wu, Jin-Kao Hao:
A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3): 693-709 (2015) - [j86]Qinghua Wu, Jin-Kao Hao:
Solving the winner determination problem via a weighted maximum clique heuristic. Expert Syst. Appl. 42(1): 355-365 (2015) - [j85]Una Benlic, Jin-Kao Hao:
Memetic search for the quadratic assignment problem. Expert Syst. Appl. 42(1): 584-595 (2015) - [j84]Xiangjing Lai, Jin-Kao Hao:
Path relinking for the fixed spectrum frequency assignment problem. Expert Syst. Appl. 42(10): 4755-4767 (2015) - [j83]Inès Sghir, Jin-Kao Hao, Inès Ben Jaâfar, Khaled Ghédira:
A multi-agent based optimization method applied to the quadratic assignment problem. Expert Syst. Appl. 42(23): 9252-9262 (2015) - [j82]Zhang-Hua Fu, Jin-Kao Hao:
Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints. INFORMS J. Comput. 27(2): 221-237 (2015) - [j81]Yan Jin, Jin-Kao Hao:
Effective Learning-Based Hybrid Search for Bandwidth Coloring. IEEE Trans. Syst. Man Cybern. Syst. 45(4): 624-635 (2015) - [c82]Inès Sghir, Jin-Kao Hao, Inès Ben Jaâfar, Khaled Ghédira:
A Distributed Hybrid Algorithm for the Graph Coloring Problem. Artificial Evolution 2015: 205-218 - [c81]Arnaud Liefooghe, Sébastien Vérel, Luís Paquete, Jin-Kao Hao:
Experiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming. EMO (1) 2015: 171-186 - [c80]Brahim Chabane, Matthieu Basseur, Jin-Kao Hao:
A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis. LION 2015: 249-255 - [i11]Xiangjing Lai, Jin-Kao Hao:
On memetic search for the max-mean dispersion problem. CoRR abs/1503.00980 (2015) - [i10]Yan Jin, Jean-Philippe Hamiez, Jin-Kao Hao:
Algorithms for the minimum sum coloring problem: a review. CoRR abs/1505.00449 (2015) - [i9]Fuda Ma, Jin-Kao Hao:
A Multiple Search Operator Heuristic for the Max-k-cut Problem. CoRR abs/1510.09156 (2015) - 2014
- [j80]Arnaud Liefooghe, Sébastien Vérel, Jin-Kao Hao:
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming. Appl. Soft Comput. 16: 10-19 (2014) - [j79]Dominique Tessier, Sami Laroum, Béatrice Duval, Emma M. Rath, W. Bret Church, Jin-Kao Hao:
In silico evaluation of the influence of the translocon on partitioning of membrane segments. BMC Bioinform. 15: 156 (2014) - [j78]Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez:
A memetic algorithm for the Minimum Sum Coloring Problem. Comput. Oper. Res. 43: 318-327 (2014) - [j77]Yang Wang, Jin-Kao Hao, Fred W. Glover, Zhipeng Lü:
A tabu search based memetic algorithm for the maximum diversity problem. Eng. Appl. Artif. Intell. 27: 103-114 (2014) - [j76]Zhang-Hua Fu, Jin-Kao Hao:
Breakout local search for the Steiner tree problem with revenue, budget and hop constraints. Eur. J. Oper. Res. 232(1): 209-220 (2014) - [j75]Yuning Chen, Jin-Kao Hao:
A "reduce and solve" approach for the multiple-choice multidimensional knapsack problem. Eur. J. Oper. Res. 239(2): 313-322 (2014) - [j74]Xing-Ming Zhao, Alioune Ngom, Jin-Kao Hao:
Pattern recognition in bioinformatics. Neurocomputing 145: 1-2 (2014) - [j73]Wassim Ayadi, Jin-Kao Hao:
A memetic algorithm for discovering negative correlation biclusters of DNA microarray data. Neurocomputing 145: 14-22 (2014) - [j72]Gary A. Kochenberger, Jin-Kao Hao, Fred W. Glover, Mark W. Lewis, Zhipeng Lü, Haibo Wang, Yang Wang:
The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1): 58-81 (2014) - [c79]François Schwarzentruber, Jin-Kao Hao:
Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search. JELIA 2014: 582-590 - [e10]Pierrick Legrand, Marc-Michel Corsini, Jin-Kao Hao, Nicolas Monmarché, Evelyne Lutton, Marc Schoenauer:
Artificial Evolution - 11th International Conference, Evolution Artificielle, EA 2013, Bordeaux, France, October 21-23, 2013. Revised Selected Papers. Lecture Notes in Computer Science 8752, Springer 2014, ISBN 978-3-319-11682-2 [contents] - [e9]Huiru Jane Zheng, Werner Dubitzky, Xiaohua Hu, Jin-Kao Hao, Daniel P. Berrar, Kwang-Hyun Cho, Yadong Wang, David R. Gilbert:
2014 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2014, Belfast, United Kingdom, November 2-5, 2014. IEEE Computer Society 2014, ISBN 978-1-4799-5669-2 [contents] - [i8]Zhang-Hua Fu, Jin-Kao Hao:
A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem. CoRR abs/1402.1379 (2014) - [i7]Tao Ye, Tao Wang, Zhipeng Lü, Jin-Kao Hao:
A Multi-parent Memetic Algorithm for the Linear Ordering Problem. CoRR abs/1405.4507 (2014) - [i6]Tao Ye, Kan Zhou, Zhipeng Lü, Jin-Kao Hao:
A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs. CoRR abs/1405.4510 (2014) - [i5]Xiangjing Lai, Zhipeng Lü, Jin-Kao Hao, Fred W. Glover, Liping Xu:
Path Relinking for Bandwidth Coloring Problem. CoRR abs/1409.0973 (2014) - [i4]Jean-Philippe Hamiez, Jin-Kao Hao:
A note on a sports league scheduling problem. CoRR abs/1410.2721 (2014) - 2013
- [j71]Una Benlic, Jin-Kao Hao:
Breakout local search for the quadratic assignment problem. Appl. Math. Comput. 219(9): 4800-4815 (2013) - [j70]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
Informed Reactive Tabu Search for Graph Coloring. Asia Pac. J. Oper. Res. 30(4) (2013) - [j69]Qinghua Wu, Jin-Kao Hao:
An Extraction and Expansion Approach for Graph Coloring. Asia Pac. J. Oper. Res. 30(5) (2013) - [j68]Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao:
Solving bi-objective flow shop problem with hybrid path relinking algorithm. Appl. Soft Comput. 13(10): 4118-4132 (2013) - [j67]Xiujun Zhang, Keqin Liu, Zhi-Ping Liu, Béatrice Duval, Jean-Michel Richer, Xing-Ming Zhao, Jin-Kao Hao, Luonan Chen:
NARROMI: a noise and redundancy reduction technique improves accuracy of gene regulatory network inference. Bioinform. 29(1): 106-113 (2013) - [j66]Qinghua Wu, Jin-Kao Hao:
Memetic search for the max-bisection problem. Comput. Oper. Res. 40(1): 166-179 (2013) - [j65]Una Benlic, Jin-Kao Hao:
Breakout Local Search for maximum clique problems. Comput. Oper. Res. 40(1): 192-206 (2013) - [j64]Yang Wang, Zhipeng Lü, Fred W. Glover, Jin-Kao Hao:
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem. Comput. Oper. Res. 40(12): 3100-3107 (2013) - [j63]Una Benlic, Jin-Kao Hao:
Breakout Local Search for the Max-Cutproblem. Eng. Appl. Artif. Intell. 26(3): 1162-1173 (2013) - [j62]Qinghua Wu, Jin-Kao Hao:
A hybrid metaheuristic method for the Maximum Diversity Problem. Eur. J. Oper. Res. 231(2): 452-464 (2013) - [j61]Gary A. Kochenberger, Jin-Kao Hao, Zhipeng Lü, Haibo Wang, Fred W. Glover:
Solving large scale Max Cut problems via tabu search. J. Heuristics 19(4): 565-571 (2013) - [j60]Yang Wang, Zhipeng Lü, Fred W. Glover, Jin-Kao Hao:
Backbone guided tabu search for solving the UBQP problem. J. Heuristics 19(4): 679-695 (2013) - [j59]Qinghua Wu, Jin-Kao Hao:
An adaptive multistart tabu search approach to solve the maximum clique problem. J. Comb. Optim. 26(1): 86-108 (2013) - [c78]Olivier Gach, Jin-Kao Hao:
Improving the Louvain Algorithm for Community Detection with Modularity Maximization. Artificial Evolution 2013: 145-156 - [c77]Inès Sghir, Jin-Kao Hao, Inès Ben Jaâfar, Khaled Ghédira:
A Recombination-Based Tabu Search Algorithm for the Winner Determination Problem. Artificial Evolution 2013: 157-167 - [c76]Rong-Qiang Zeng, Matthieu Basseur, Jin-Kao Hao:
Hypervolume-Based Multi-Objective Path Relinking Algorithm. EMO 2013: 185-199 - [c75]Una Benlic, Jin-Kao Hao:
A Study of Adaptive Perturbation Strategy for Iterated Local Search. EvoCOP 2013: 61-72 - [c74]Una Benlic, Jin-Kao Hao:
Breakout Local Search for the Vertex Separator Problem. IJCAI 2013: 461-467 - [p4]Philippe Galinier, Jean-Philippe Hamiez, Jin-Kao Hao, Daniel Cosmin Porumbel:
Recent Advances in Graph Vertex Coloring. Handbook of Optimization 2013: 505-528 - [p3]Una Benlic, Jin-Kao Hao:
Hybrid Metaheuristics for the Graph Partitioning Problem. Hybrid Metaheuristics 2013: 157-185 - [e8]Alioune Ngom, Enrico Formenti, Jin-Kao Hao, Xing-Ming Zhao, Twan van Laarhoven:
Pattern Recognition in Bioinformatics - 8th IAPR International Conference, PRIB 2013, Nice, France, June 17-20, 2013. Proceedings. Lecture Notes in Computer Science 7986, Springer 2013, ISBN 978-3-642-39158-3 [contents] - [i3]Qinghua Wu, Jin-Kao Hao:
Improved Lower Bounds for Sum Coloring via Clique Decomposition. CoRR abs/1303.6761 (2013) - [i2]Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez:
A memetic algorithm for the minimum sum coloring problem. CoRR abs/1304.2641 (2013) - [i1]Yang Wang, Jin-Kao Hao, Fred W. Glover, Zhipeng Lü:
Solving the minimum sum coloring problem via binary quadratic programming. CoRR abs/1304.5876 (2013) - 2012
- [j58]Qinghua Wu, Jin-Kao Hao, Fred W. Glover:
Multi-neighborhood tabu search for the maximum weight clique problem. Ann. Oper. Res. 196(1): 611-634 (2012) - [j57]Zhipeng Lü, Jin-Kao Hao:
Adaptive memory-based local search for MAX-SAT. Appl. Soft Comput. 12(8): 2063-2071 (2012) - [j56]Xiujun Zhang, Xing-Ming Zhao, Kun He, Le Lu, Yongwei Cao, Jingdong Liu, Jin-Kao Hao, Zhi-Ping Liu, Luonan Chen:
Inferring gene regulatory networks from gene expression data by path consistency algorithm based on conditional mutual information. Bioinform. 28(1): 98-104 (2012) - [j55]Keqin Liu, Zhi-Ping Liu, Jin-Kao Hao, Luonan Chen, Xing-Ming Zhao:
Identifying dysregulated pathways in cancers from pathway interaction networks. BMC Bioinform. 13: 126 (2012) - [j54]Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao:
Pattern-driven neighborhood search for biclustering of microarray data. BMC Bioinform. 13(S-7): S11 (2012) - [j53]Qinghua Wu, Jin-Kao Hao:
Coloring large graphs based on independent set extraction. Comput. Oper. Res. 39(2): 283-290 (2012) - [j52]Qinghua Wu, Jin-Kao Hao:
An effective heuristic algorithm for sum coloring of graphs. Comput. Oper. Res. 39(7): 1593-1600 (2012) - [j51]Jin-Kao Hao, Qinghua Wu:
Improving the extraction and expansion method for large graph coloring. Discret. Appl. Math. 160(16-17): 2397-2407 (2012) - [j50]Zhipeng Lü, Jin-Kao Hao:
Adaptive neighborhood search for nurse rostering. Eur. J. Oper. Res. 218(3): 865-876 (2012) - [j49]Yang Wang, Zhipeng Lü, Fred W. Glover, Jin-Kao Hao:
Path relinking for unconstrained binary quadratic programming. Eur. J. Oper. Res. 223(3): 595-604 (2012) - [j48]Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao:
BicFinder: a biclustering algorithm for microarray data analysis. Knowl. Inf. Syst. 30(2): 341-358 (2012) - [j47]Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao:
BiMine+: An efficient algorithm for discovering relevant biclusters of DNA microarray data. Knowl. Based Syst. 35: 224-234 (2012) - [j46]Matthieu Basseur, Rong-Qiang Zeng, Jin-Kao Hao:
Hypervolume-based multi-objective local search. Neural Comput. Appl. 21(8): 1917-1929 (2012) - [c73]Yang Wang, Zhipeng Lü, Fred W. Glover, Jin-Kao Hao:
A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization. CPAIOR 2012: 395-408 - [c72]Qinghua Wu, Jin-Kao Hao:
A Memetic Approach for the Max-Cut Problem. PPSN (2) 2012: 297-306 - [c71]Olivier Gach, Jin-Kao Hao:
A Memetic Algorithm for Community Detection in Complex Networks. PPSN (2) 2012: 327-336 - [c70]Sami Laroum, Béatrice Duval, Dominique Tessier, Jin-Kao Hao:
A Genetic Algorithm for Scale-Based Translocon Simulation. PRIB 2012: 26-37 - [c69]Una Benlic, Jin-Kao Hao:
A Study of Breakout Local Search for the Minimum Sum Coloring Problem. SEAL 2012: 128-137 - [p2]Jin-Kao Hao:
Memetic Algorithms in Discrete Optimization. Handbook of Memetic Algorithms 2012: 73-94 - [e7]Jin-Kao Hao, Pierrick Legrand, Pierre Collet, Nicolas Monmarché, Evelyne Lutton, Marc Schoenauer:
Artificial Evolution - 10th International Conference, Evolution Artificielle, EA 2011, Angers, France, October 24-26, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7401, Springer 2012, ISBN 978-3-642-35532-5 [contents] - [e6]Jin-Kao Hao, Martin Middendorf:
Evolutionary Computation in Combinatorial Optimization - 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings. Lecture Notes in Computer Science 7245, Springer 2012, ISBN 978-3-642-29123-4 [contents] - 2011
- [j45]Fred W. Glover, Jin-Kao Hao:
The case for strategic oscillation. Ann. Oper. Res. 183(1): 163-173 (2011) - [j44]Daniel Cosmin Porumbel, Jin-Kao Hao, Fred W. Glover:
A simple and effective algorithm for the MaxMin diversity problem. Ann. Oper. Res. 186(1): 275-293 (2011) - [j43]Hakim Mabed, Alexandre Caminada, Jin-Kao Hao:
Genetic Tabu search for robust fixed channel assignment under dynamic traffic data. Comput. Optim. Appl. 50(3): 483-506 (2011) - [j42]Una Benlic, Jin-Kao Hao:
An effective multilevel tabu search approach for balanced graph partitioning. Comput. Oper. Res. 38(7): 1066-1075 (2011) - [j41]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
An efficient algorithm for computing the distance between close partitions. Discret. Appl. Math. 159(1): 53-59 (2011) - [j40]Jin-Kao Hao, Una Benlic:
Lower bounds for the ITC-2007 curriculum-based course timetabling problem. Eur. J. Oper. Res. 212(3): 464-472 (2011) - [j39]Zhipeng Lü, Jin-Kao Hao, Fred W. Glover:
Neighborhood analysis: a case study on curriculum-based course timetabling. J. Heuristics 17(2): 97-118 (2011) - [j38]Fred W. Glover, Jin-Kao Hao, Gary A. Kochenberger:
Polynomial unconstrained binary optimisation - Part 1. Int. J. Metaheuristics 1(3): 232-256 (2011) - [j37]Fred W. Glover, Jin-Kao Hao, Gary A. Kochenberger:
Polynomial unconstrained binary optimisation - Part 2. Int. J. Metaheuristics 1(4): 317-354 (2011) - [j36]Una Benlic, Jin-Kao Hao:
A Multilevel Memetic Approach for Improving Graph k-Partitions. IEEE Trans. Evol. Comput. 15(5): 624-642 (2011) - [c68]Yang Wang, Zhipeng Lü, Fred W. Glover, Jin-Kao Hao:
Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming. EvoCOP 2011: 72-83 - [c67]Sami Laroum, Béatrice Duval, Dominique Tessier, Jin-Kao Hao:
Multi-Neighborhood Search for Discrimination of Signal Peptides and Transmembrane Segments. EvoBio 2011: 111-122 - [c66]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
Spacing memetic algorithms. GECCO 2011: 1061-1068 - [c65]Edmundo Bonilla Huerta, Béatrice Duval, José Crispín Hernández Hernández, Jin-Kao Hao, Roberto Morales-Caporal:
Hybrid Filter-Wrapper with a Specialized Random Multi-Parent Crossover Operator for Gene Selection and Classification Problems. ICIC (3) 2011: 453-461 - [e5]Peter Merz, Jin-Kao Hao:
Evolutionary Computation in Combinatorial Optimization - 11th European Conference, EvoCOP 2011, Torino, Italy, April 27-29, 2011. Proceedings. Lecture Notes in Computer Science 6622, Springer 2011, ISBN 978-3-642-20363-3 [contents] - 2010
- [j35]Fred W. Glover, Zhipeng Lü, Jin-Kao Hao:
Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR 8(3): 239-253 (2010) - [j34]Béatrice Duval, Jin-Kao Hao:
Advances in metaheuristics for gene selection and classification of microarray data. Briefings Bioinform. 11(1): 127-141 (2010) - [j33]Valérie Guihaire, Jin-Kao Hao:
Transit network timetabling and vehicle assignment for regulating authorities. Comput. Ind. Eng. 59(1): 16-23 (2010) - [j32]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
A search space "cartography" for guiding graph coloring heuristics. Comput. Oper. Res. 37(4): 769-778 (2010) - [j31]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. Comput. Oper. Res. 37(10): 1822-1832 (2010) - [j30]Zhipeng Lü, Jin-Kao Hao:
Adaptive Tabu Search for course timetabling. Eur. J. Oper. Res. 200(1): 235-244 (2010) - [j29]Zhipeng Lü, Jin-Kao Hao:
A memetic algorithm for graph coloring. Eur. J. Oper. Res. 203(1): 241-250 (2010) - [j28]Zhipeng Lü, Fred W. Glover, Jin-Kao Hao:
A hybrid metaheuristic approach to solving the UBQP problem. Eur. J. Oper. Res. 207(3): 1254-1262 (2010) - [j27]Giglia Gómez-Villouta, Jean-Philippe Hamiez, Jin-Kao Hao:
A Reinforced Tabu Search Approach for 2D Strip Packing. Int. J. Appl. Metaheuristic Comput. 1(3): 20-36 (2010) - [j26]Jean-Philippe Hamiez, Jin-Kao Hao, Fred W. Glover:
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition. Int. J. Appl. Metaheuristic Comput. 1(4): 1-24 (2010) - [j25]Fred W. Glover, Jin-Kao Hao:
Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems. Int. J. Metaheuristics 1(1): 3-10 (2010) - [j24]Fred W. Glover, Jin-Kao Hao:
Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems. Int. J. Metaheuristics 1(2): 100-107 (2010) - [j23]Edmundo Bonilla Huerta, Béatrice Duval, Jin-Kao Hao:
A hybrid LDA and genetic algorithm for gene selection and classification of microarray data. Neurocomputing 73(13-15): 2375-2383 (2010) - [c64]Sami Laroum, Dominique Tessier, Béatrice Duval, Jin-Kao Hao:
A Local Search Appproach for Transmembrane Segment and Signal Peptide Discrimination. EvoBIO 2010: 134-145 - [c63]Zhipeng Lü, Jin-Kao Hao, Fred W. Glover:
A Study of Memetic Search with Multi-parent Combination for UBQP. EvoCOP 2010: 154-165 - [c62]Una Benlic, Jin-Kao Hao:
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning. ICTAI (1) 2010: 121-128 - [c61]Giglia Gómez-Villouta, Jean-Philippe Hamiez, Jin-Kao Hao:
Tabu Search with Consistent Neighbourhood for Strip Packing. IEA/AIE (1) 2010: 1-10 - [c60]Valérie Guihaire, Jin-Kao Hao:
Improving Timetable Quality in Scheduled Transit Networks. IEA/AIE (1) 2010: 21-30 - [c59]Yang Wang, Zhipeng Lü, Jin-Kao Hao:
A Study of Multi-parent Crossover Operators in a Memetic Algorithm. PPSN (1) 2010: 556-565 - [c58]Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao:
Iterated Local Search for Biclustering of Microarray Data. PRIB 2010: 219-229
2000 – 2009
- 2009
- [j22]Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao:
A biclustering algorithm based on a Bicluster Enumeration Tree: application to DNA microarray data. BioData Min. 2: 9 (2009) - [j21]Benoît Laurent, Jin-Kao Hao:
Iterated local search for the multiple depot vehicle scheduling problem. Comput. Ind. Eng. 57(1): 277-286 (2009) - [j20]Benoît Laurent, Jin-Kao Hao:
List-graph colouring for multiple depot vehicle scheduling. Int. J. Math. Oper. Res. 1(1/2): 228-245 (2009) - [c57]Zhipeng Lü, Jin-Kao Hao:
A Critical Element-Guided Perturbation Strategy for Iterated Local Search. EvoCOP 2009: 1-12 - [c56]Jean-Philippe Hamiez, Julien Robet, Jin-Kao Hao:
A Tabu Search Algorithm with Direct Representation for Strip Packing. EvoCOP 2009: 61-72 - [c55]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms. EvoCOP 2009: 121-132 - [c54]Jean-Michel Richer, Adrien Goëffon, Jin-Kao Hao:
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony. EvoBIO 2009: 164-175 - [c53]Béatrice Duval, Jin-Kao Hao, José Crispín Hernández Hernández:
A memetic algorithm for gene selection and molecular classification of cancer. GECCO 2009: 201-208 - [c52]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem. LION 2009: 148-162 - [e4]Matthias Ehrgott, Carlos M. Fonseca, Xavier Gandibleux, Jin-Kao Hao, Marc Sevaux:
Evolutionary Multi-Criterion Optimization, 5th International Conference, EMO 2009, Nantes, France, April 7-10, 2009. Proceedings. Lecture Notes in Computer Science 5467, Springer 2009, ISBN 978-3-642-01019-4 [contents] - 2008
- [j19]Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez:
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. Comput. Oper. Res. 35(10): 3331-3346 (2008) - [j18]Jean-Philippe Hamiez, Jin-Kao Hao:
Using solution properties within an enumerative search to solve a sports league scheduling problem. Discret. Appl. Math. 156(10): 1683-1693 (2008) - [j17]Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez:
An improved simulated annealing algorithm for bandwidth minimization. Eur. J. Oper. Res. 185(3): 1319-1335 (2008) - [j16]Edmundo Bonilla Huerta, Béatrice Duval, Jin-Kao Hao:
Fuzzy Logic for Elimination of Redundant Information of Microarray Data. Genom. Proteom. Bioinform. 6(2): 61-73 (2008) - [j15]Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao:
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 5(1): 136-145 (2008) - [c51]Zhipeng Lü, Jin-Kao Hao:
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm. AIMSA 2008: 262-273 - [c50]José Crispín Hernández Hernández, Béatrice Duval, Jin-Kao Hao:
SVM-Based Local Search for Gene Selection and Classification of Microarray Data. BIRD 2008: 499-508 - [c49]Benoît Laurent, Jin-Kao Hao:
Simultaneous Vehicle and Crew Scheduling for Extra Urban Transports. IEA/AIE 2008: 466-475 - [c48]Valérie Guihaire, Jin-Kao Hao:
Transit Network Re-timetabling and Vehicle Scheduling. MCO 2008: 135-144 - [c47]Edmundo Bonilla Huerta, Béatrice Duval, Jin-Kao Hao:
Gene Selection for Microarray Data by a LDA-Based Genetic Algorithm. PRIB 2008: 250-261 - 2007
- [j14]Benoît Laurent, Jin-Kao Hao:
Simultaneous vehicle and driver scheduling: A case study in a limousine rental company. Comput. Ind. Eng. 53(3): 542-558 (2007) - [c46]Daniela Barreiro Claro, Patrick Albers, Jin-Kao Hao:
A Framework for Automatic Composition of RFQ Web Services. IEEE SCW 2007: 221-228 - [c45]Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz:
A Study of Evaluation Functions for the Graph K-Coloring Problem. Artificial Evolution 2007: 124-135 - [c44]José Crispín Hernández Hernández, Béatrice Duval, Jin-Kao Hao:
A Study of Crossover Operators for Gene Selection of Microarray Data. Artificial Evolution 2007: 243-254 - [c43]Jean-Michel Richer, Vincent Derrien, Jin-Kao Hao:
A New Dynamic Programming Algorithm for Multiple Sequence Alignment. COCOA 2007: 52-61 - [c42]José Crispín Hernández Hernández, Béatrice Duval, Jin-Kao Hao:
A Genetic Embedded Approach for Gene Selection and Classification of Microarray Data. EvoBIO 2007: 90-101 - [c41]Benoît Laurent, Jin-Kao Hao:
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem. SLS 2007: 197-201 - 2006
- [j13]Frédéric Lardeux, Frédéric Saubion, Jin-Kao Hao:
GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem. Evol. Comput. 14(2): 223-253 (2006) - [c40]Jean-Philippe Hamiez, Jin-Kao Hao:
Sports League Scheduling: Enumerative Search for Prob026 from CSPLib. CP 2006: 716-720 - [c39]Edmundo Bonilla Huerta, Béatrice Duval, Jin-Kao Hao:
A Hybrid GA/SVM Approach for Gene Selection and Classification of Microarray Data. EvoWorkshops 2006: 34-44 - [c38]Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez:
A Refined Evaluation Function for the MinLA Problem. MICAI 2006: 392-403 - [c37]Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao:
A Distance-Based Information Preservation Tree Crossover for the Maximum Parsimony Problem. PPSN 2006: 761-770 - [p1]Daniela Barreiro Claro, Patrick Albers, Jin-Kao Hao:
Web Services Composition. Semantic Web Services, Processes and Applications 2006: 195-225 - 2005
- [j12]Hervé Deleau, Jin-Kao Hao, Frédéric Saubion:
Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes. RAIRO Oper. Res. 39(2): 87-103 (2005) - [c36]Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez:
Memetic Algorithms for the MinLA Problem. Artificial Evolution 2005: 73-84 - [c35]Daniela Barreiro Claro, Patrick Albers, Jin-Kao Hao:
Approaches of Web Services Composition - Comparison between BPEL4WS and OWL-S. ICEIS (4) 2005: 208-213 - [c34]Adrien Goëffon, Jean-Michel Richer, Jin-Kao Hao:
Local Search for the Maximum Parsimony Problem. ICNC (3) 2005: 678-683 - [c33]Daniela Barreiro Claro, Patrick Albers, Jin-Kao Hao:
Selecting Web Services for Optimal Composition. SDWP@ICWS 2005 - [c32]Frédéric Lardeux, Frédéric Saubion, Jin-Kao Hao:
Three Truth Values for the SAT and MAX-SAT Problems. IJCAI 2005: 187-192 - [c31]Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez:
A Comparison of Memetic Recombination Operators for the MinLA Problem. MICAI 2005: 613-622 - [c30]Benoît Laurent, Valérie Guihaire, Jin-Kao Hao:
A Heuristic Solution for a Driver-Vehicle Scheduling Problem. OR 2005: 703-708 - 2004
- [j11]Jean-Philippe Hamiez, Jin-Kao Hao:
A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of SPLib). Discret. Appl. Math. 143(1-3): 252-265 (2004) - [j10]Philippe Galinier, Jin-Kao Hao:
A General Approach for Constraint Solving by Local Search. J. Math. Model. Algorithms 3(1): 73-88 (2004) - [c29]Vincent Barichard, Jin-Kao Hao:
Recherche locale dichotomique pour la résolution des CSP continus. JFPLC 2004 - [c28]Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez:
An Improved Evaluation Function for the Bandwidth Minimization Problem. PPSN 2004: 652-661 - 2003
- [j9]Michel Vasquez, Jin-Kao Hao:
Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem. J. Comb. Optim. 7(1): 87-103 (2003) - [j8]Vincent Barichard, Jin-Kao Hao:
Une approche hybride pour l'optimisation multi-objectif sous contraintes. Tech. Sci. Informatiques 22(1): 33-46 (2003) - [j7]Vincent Barichard, Hervé Deleau, Jin-Kao Hao, Frédéric Saubion:
Évolution + Adaptation = Résolution. Tech. Sci. Informatiques 22(1): 281-294 (2003) - [c27]Vincent Barichard, Hervé Deleau, Jin-Kao Hao, Frédéric Saubion:
A Hybrid Evolutionary Algorithm for CSP. Artificial Evolution 2003: 79-90 - [c26]Frédéric Lardeux, Frédéric Saubion, Jin-Kao Hao:
Recombination Operators for Satisfiability Problems. Artificial Evolution 2003: 103-114 - [c25]Vincent Barichard, Jin-Kao Hao:
A Population and Interval Constraint Propagation Algorithm. EMO 2003: 88-101 - [c24]Jin-Kao Hao, Frédéric Lardeux, Frédéric Saubion:
Evolutionary Computing for the Satisfiability Problem. EvoWorkshops 2003: 258-267 - [c23]Hakim Mabed, Alexandre Caminada, Jin-Kao Hao:
Multi-period Channel Assignment. PWC 2003: 541-554 - [c22]Vincent Barichard, Jin-Kao Hao:
Une approche hybride pour l'optimisation multi-objectif sous contraintes. JFPLC 2003: 33-46 - [c21]Vincent Barichard, Hervé Deleau, Jin-Kao Hao, Frédéric Saubion:
Evolution + Adaptation = Résolution. JFPLC 2003: 281-294 - 2002
- [j6]Nicolas Pech-Gourg, Jin-Kao Hao:
Métaheuristiques pour la classification de bouchons naturels en liège. Rev. d'Intelligence Artif. 16(6): 785-806 (2002) - [c20]Hakim Mabed, Alexandre Caminada, Jin-Kao Hao, Denis Renaud:
A Dynamic Traffic Model for Frequency Assignment. PPSN 2002: 779-788 - [e3]Pierre Collet, Cyril Fonlupt, Jin-Kao Hao, Evelyne Lutton, Marc Schoenauer:
Artificial Evolution, 5th International Conference, Evolution Artificielle, EA 2001, Le Creusot, France, October 29-31, 2001, Selected Papers. Lecture Notes in Computer Science 2310, Springer 2002, ISBN 3-540-43544-1 [contents] - 2001
- [j5]Michel Vasquez, Jin-Kao Hao:
A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite. Comput. Optim. Appl. 20(2): 137-157 (2001) - [j4]Michel Vasquez, Jin-Kao Hao:
A Heuristic Approach for Antenna Positioning in Cellular Networks. J. Heuristics 7(5): 443-472 (2001) - [j3]Michel Vasquez, Jin-Kao Hao:
Une approche hybride pour le sac à dos multidimensionnel en variables 0-1. RAIRO Oper. Res. 35(4): 415-438 (2001) - [c19]Jean-Philippe Hamiez, Jin-Kao Hao:
Scatter Search for Graph Coloring. Artificial Evolution 2001: 168-179 - [c18]Meriema Belaidouni, Jin-Kao Hao:
SAT, Local Search Dynamics and Density of States. Artificial Evolution 2001: 192-204 - [c17]Michel Vasquez, Jin-Kao Hao:
A Hybrid Approach for the 01 Multidimensional Knapsack problem. IJCAI 2001: 328-333 - 2000
- [c16]Meriema Belaidouni, Jin-Kao Hao:
A measure of combinational landscape difficulty for the Metropolis algorithm. AI&M 2000 - [c15]Jean-Philippe Hamiez, Jin-Kao Hao:
Solving the Sports League Scheduling Problem with Tabu Search. Local Search for Planning and Scheduling 2000: 24-36 - [c14]Meriema Belaidouni, Jin-Kao Hao:
An Analysis of the Configuration Space of the Maximal Constraint Satisfaction Problem. PPSN 2000: 49-58 - [e2]Cyril Fonlupt, Jin-Kao Hao, Evelyne Lutton, Edmund M. A. Ronald, Marc Schoenauer:
Artificial Evolution, 4th European Conference, AE'99, Dunkerque, France, November 3-5, 1999, Selected Papers. Lecture Notes in Computer Science 1829, Springer 2000, ISBN 3-540-67846-8 [contents]
1990 – 1999
- 1999
- [j2]Philippe Galinier, Jin-Kao Hao:
Hybrid Evolutionary Algorithms for Graph Coloring. J. Comb. Optim. 3(4): 379-397 (1999) - [c13]Meriema Belaidouni, Jin-Kao Hao:
Landscapes and the Maximal Constraint Satisfaction Problem. Artificial Evolution 1999: 242-253 - 1998
- [j1]Jin-Kao Hao, Raphaël Dorne, Philippe Galinier:
Tabu Search for Frequency Assignment in Mobile Radio Networks. J. Heuristics 4(1): 47-62 (1998) - [c12]Raphaël Dorne, Jin-Kao Hao:
A New Genetic Local Search Algorithm for Graph Coloring. PPSN 1998: 745-754 - [e1]Jin-Kao Hao, Evelyne Lutton, Edmund M. A. Ronald, Marc Schoenauer, Dominique Snyers:
Artificial Evolution, Third European Conference, AE'97, Nîmes, France, 22-24 October 1997, Selected Papers. Lecture Notes in Computer Science 1363, Springer 1998, ISBN 3-540-64169-6 [contents] - 1997
- [c11]Philippe Galinier, Jin-Kao Hao:
Tabu Search for Maximal Constraint Satisfaction Problems. CP 1997: 196-208 - 1996
- [c10]Jin-Kao Hao, Raphaël Dorne:
Empirical Studies of Heuristic Local Search for Constraint Solving. CP 1996: 194-208 - [c9]Raphaël Dorne, Jin-Kao Hao:
Constraint Handling in Evolutionary Search: A Case Study of the Frequency Assignment. PPSN 1996: 801-810 - 1995
- [c8]Jin-Kao Hao, Raphaël Dorne:
Study of Genetic Search for the Frequency Assignment Problem. Artificial Evolution 1995: 333-344 - [c7]Jin-Kao Hao:
A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems. ICANNGA 1995: 289-292 - 1994
- [c6]Jin-Kao Hao, Raphaël Dorne:
A New Population-Based Method for Satisfiability Problems. ECAI 1994: 135-139 - [c5]Jin-Kao Hao, Raphaël Dorne:
An Empirical Comparison of Two Evolutionary Methods for Satisfiability Problems. International Conference on Evolutionary Computation 1994: 451-455 - 1992
- [c4]Jin-Kao Hao, François Trousset, Jean-Jacques Chabrier:
Prototyping an Inconsistency Checking Tool for Software Process Models. SEKE 1992: 227-234 - 1991
- [c3]Jin-Kao Hao, Jean-Jacques Chabrier:
A modular architecture for constraint logic programming. ACM Conference on Computer Science 1991: 203-210 - 1990
- [c2]Jin-Kao Hao, Jean-Jacques Chabrier:
Combining partial evaluation and constraint solving: a new approach to constraint logic programming. TAI 1990: 494-500 - [c1]Jin-Kao Hao, Jean-Jacques Chabrier:
Combining Partial Evaluation and Constraint Solving: A new approach to Constraint Logic Programming. SPLT 1990: 431-446
Coauthor Index
Daniel Cosmin Porumbel
aka: Daniel Porumbel
aka: Daniel Porumbel
[j213] [j211] [j209] [j208] [j203] [j202] [j201] [j200] [i35] [i33] [i32] [j189] [j187] [j186] [j185] [j179] [j176] [j173] [j172] [j156] [j155] [j151] [j150] [j146] [j144] [i23] [j136] [j131] [j127] [j125] [j120] [c83] [j100] [j97] [j87] [j86] [j69] [j66] [j62] [j59] [i3] [j58] [j53] [j52] [j51] [c72]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
