default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhouxing Su
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Bo Peng
, Songge Wang, Donghao Liu, Zhouxing Su, Zhipeng Lü, Fred W. Glover:
Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm. Expert Syst. Appl. 237(Part B): 121477 (2024)- [j11]Xiao-Lu Liu, Hong-Yun Xu, Jia-Ming Chen, Zhouxing Su, Zhi-Peng Lyu, Jun-Wen Ding:
Neighborhood Combination Search for Single-Machine Scheduling with Sequence-Dependent Setup Time. J. Comput. Sci. Technol. 39(3): 737-752 (2024) - [j10]Canhui Luo, Zhouxing Su, Zhipeng Lü:
MS-CLS: An Effective Partitioning and Placement Metaheuristic for Wafer-Scale Physics Modeling. IEEE Trans. Emerg. Top. Comput. Intell. 8(2): 1194-1208 (2024) - [j9]Yang Wang, Zhipeng Lü, Junwen Ding, Zhouxing Su, Rafael Martí:
A Weighted Vertex Cover-Based Intensification Tabu Search for the Capacitated Dispersion Problem. IEEE Trans. Emerg. Top. Comput. Intell. 8(6): 4225-4236 (2024) - [c13]Qingyun Zhang, Yuming Du, Zhouxing Su, Chu-Min Li, Junzhou Xu, Zhihuai Chen, Zhipeng Lü:
Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem. AAAI 2024: 20856-20864 - [c12]Canhui Luo, Zhouxing Su, Zhipeng Lü:
A General Heuristic Approach for Maximum Polygon Packing (CG Challenge). SoCG 2024: 86:1-86:9 - [c11]Zhenxuan Xie, Zhipeng Lü, Zhouxing Su, Chu-Min Li, Junwen Ding, Yuxuan Wang:
A Swap Relaxation-Based Local Search for the Latin Square Completion Problem. IJCAI 2024: 7047-7055 - 2023
- [j8]Qingyun Zhang, Zhipeng Lü, Zhouxing Su, Chumin Li:
A vertex weighting-based double-tabu search algorithm for the classical p-center problem. Comput. Oper. Res. 160: 106373 (2023) - [j7]Zhipeng Lü, Yuan Fang, Zhouxing Su, Yang Wang, Xinyun Wu, Fred W. Glover:
Dual-neighborhood iterated local search for routing and wavelength assignment. Comput. Oper. Res. 160: 106396 (2023) - [j6]Zhipeng Lü, Yan Li, Zhouxing Su, Yaozhong Zhao, Junwen Ding:
An Effective Scoring-Based Metaheuristic Algorithm for Rectilinear Block Placement. IEEE Trans. Emerg. Top. Comput. Intell. 7(6): 1733-1745 (2023) - [c10]Junwen Ding, Liangcai Song, Siyuan Li, Chen Wu, Ronghua He, Zhouxing Su, Zhipeng Lü:
A Heuristic Method for Data Allocation and Task Scheduling on Heterogeneous Multiprocessor Systems Under Memory Constraints. ICA3PP (2) 2023: 360-380 - [c9]Qingyun Zhang, Zhipeng Lü, Zhouxing Su:
A Two-Stage Iterated Local Search Algorithm for the Capacitated p-Center Problem. SMC 2023: 5070-5075 - [c8]Wenhan Shao, Zhouxing Su, Junwen Ding, Zhipeng Lü:
A Memetic Algorithm for the Multi-Depot Vehicle Routing Problem. SMC 2023: 5076-5083 - 2022
- [j5]Xiaolu Liu, Jiaming Chen, Minghui Wang, Yang Wang, Zhouxing Su, Zhipeng Lü:
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem. Discret. Optim. 44(Part): 100613 (2022) - [c7]Qingyun Zhang, Zhouxing Su, Zhipeng Lü, Lingxiao Yang:
A Weighting-Based Tabu Search Algorithm for the p-Next Center Problem. IJCAI 2022: 4828-4834 - [c6]Yuming Du, Qingyun Zhang, Junzhou Xu, Shungen Zhang, Chao Liao, Zhihuai Chen, Zhibo Sun, Zhouxing Su, Junwen Ding, Chen Wu, Pinyan Lu, Zhi-Peng Lv:
PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem. IPEC 2022: 29:1-29:3 - [i1]Junwen Ding, Liangcai Song, Siyuan Li, Chen Wu, Ronghua He, Zhouxing Su, Zhipeng Lü:
A heuristic method for data allocation and task scheduling on heterogeneous multiprocessor systems under memory constraints. CoRR abs/2206.05268 (2022) - 2021
- [j4]Yang Wang, Zhipeng Lü, Zhouxing Su:
A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem. Comput. Oper. Res. 135: 105427 (2021) - [c5]Zhouxing Su, Qingyun Zhang, Zhipeng Lü, Chu-Min Li, Weibo Lin, Fuda Ma:
Weighting-based Variable Neighborhood Search for Optimal Camera Placement. AAAI 2021: 12400-12408 - 2020
- [j3]Xiaolu Liu, Yuan Fang, Jiaming Chen, Zhouxing Su, Chumin Li, Zhipeng Lü:
Effective Approaches to Solve P-Center Problem via Set Covering and SAT. IEEE Access 8: 161232-161244 (2020) - [j2]Zhouxing Su, Zhipeng Lü, Zhuo Wang, Yanmin Qi, Una Benlic:
A Matheuristic Algorithm for the Inventory Routing Problem. Transp. Sci. 54(2): 330-354 (2020) - [c4]Weibo Lin, Fuda Ma, Zhouxing Su, Qingyun Zhang, Chumin Li, Zhipeng Lü:
Weighting-based parallel local search for optimal camera placement and unicost set covering. GECCO Companion 2020: 3-4 - [c3]Qingyun Zhang, Zhipeng Lü, Zhouxing Su, Chumin Li, Yuan Fang, Fuda Ma:
Vertex Weighting-Based Tabu Search for p-Center Problem. IJCAI 2020: 1481-1487 - [c2]Zhouxing Su, Shihao Huang, Chungen Li, Zhipeng Lü:
A Two-Stage Matheuristic Algorithm for Classical Inventory Routing Problem. IJCAI 2020: 3430-3436 - [c1]Yuan Fang, Zhipeng Lü, Zhouxing Su, Yang Wang, Tiancheng Zhang, Qingyun Zhang:
Local Search based on a New Neighborhood for Routing and Wavelength Assignment. SMC 2020: 1123-1128
2010 – 2019
- 2019
- [j1]Zhouxing Su, Junchen Zhang, Zhipeng Lü:
A Multi-Stage Metaheuristic Algorithm for Shortest Simple Path Problem With Must-Pass Nodes. IEEE Access 7: 52142-52154 (2019)
Coauthor Index
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 2025-01-21 00:06 CET 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:
