![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Xiangjing Lai
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j28]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) - [i4]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
- [j27]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) - [j26]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) - [j25]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) - 2022
- [j24]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) - 2021
- [j23]Wen Sun, Jin-Kao Hao, Yuhao Zang
, Xiangjing Lai:
A solution-driven multilevel approach for graph coloring. Appl. Soft Comput. 104: 107174 (2021) - [j22]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) - [j21]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) - [j20]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) - [j19]Hongjun Chu
, Dong Yue
, Lixin Gao
, Xiangjing Lai
:
Consensus of Multiagent Systems With Relative State Saturations. IEEE Trans. Syst. Man Cybern. Syst. 51(4): 2391-2402 (2021) - 2020
- [j18]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) - [j17]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) - [j16]Haidong Hu, Chi-Man Pun
, Ye Liu, Xiangjing Lai, Zeyu Yang, Hao Gao
:
An artificial bee algorithm with a leading group and its application into image registration. Multim. Tools Appl. 79(21-22): 14643-14669 (2020)
2010 – 2019
- 2019
- [j15]Zhang-Hua Fu
, Si-Bo Chen, Yi-Fei Ming, Yong-Quan Chen, Xiangjing Lai:
Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices. IEEE Access 7: 16351-16363 (2019) - [j14]Xiangjing Lai
, Zhang-Hua Fu
:
A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem. IEEE Access 7: 181357-181368 (2019) - [j13]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) - [j12]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) - [c5]Dongni Luo, Xiangjing Lai, Qin Sun:
Iterated Tabu Search Algorithm for the Multidemand Multidimensional Knapsack Problem. ISICA 2019: 541-550 - [i3]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
- [j11]Xiaoyun Xia
, Xue Peng, Liuyang Deng, Xinsheng Lai, Zhaolu Guo, Xiangjing Lai:
Performance Analysis of Evolutionary Optimization for the Bank Account Location Problem. IEEE Access 6: 17756-17767 (2018) - [j10]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) - [j9]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) - [j8]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) - [c4]Hongjun Chu, Dong Yue, Xiangjing Lai:
Consensus of Multi-agent Systems with Relative State Saturations. CCIS 2018: 23-27 - [c3]Xiangjing Lai, Jin-Kao Hao, Dong Yue, Hao Gao:
Diversification-driven Memetic Algorithm for the Maximum Diversity Problem. CCIS 2018: 310-314 - [c2]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
- [c1]Wen Sun, Jin-Kao Hao, Xiangjing Lai, Qinghua Wu:
On feasible and infeasible search for equitable graph coloring. GECCO 2017: 369-376 - 2016
- [j7]Xiangjing Lai, Jin-Kao Hao:
A tabu search based memetic algorithm for the max-mean dispersion problem. Comput. Oper. Res. 72: 118-127 (2016) - [j6]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) - [j5]Xiangjing Lai, Jin-Kao Hao:
Iterated variable neighborhood search for the capacitated clustering problem. Eng. Appl. Artif. Intell. 56: 102-120 (2016) - [j4]Xiangjing Lai, Jin-Kao Hao
:
Iterated maxima search for the maximally diverse grouping problem. Eur. J. Oper. Res. 254(3): 780-800 (2016) - 2015
- [j3]Xiangjing Lai, Jin-Kao Hao, Fred W. Glover:
Backtracking based iterated tabu search for equitable coloring. Eng. Appl. Artif. Intell. 46: 269-278 (2015) - [j2]Xiangjing Lai, Jin-Kao Hao:
Path relinking for the fixed spectrum frequency assignment problem. Expert Syst. Appl. 42(10): 4755-4767 (2015) - [i2]Xiangjing Lai, Jin-Kao Hao:
On memetic search for the max-mean dispersion problem. CoRR abs/1503.00980 (2015) - 2014
- [i1]Xiangjing Lai, Zhipeng Lü, Jin-Kao Hao, Fred W. Glover, Liping Xu:
Path Relinking for Bandwidth Coloring Problem. CoRR abs/1409.0973 (2014) - 2013
- [j1]Xiangjing Lai, Zhipeng Lü:
Multistart Iterated Tabu Search for Bandwidth Coloring Problem. Comput. Oper. Res. 40(5): 1401-1409 (2013)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-07-24 20:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint