Wenxun Xing

669 total citations
50 papers, 466 citations indexed

About

Wenxun Xing is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Industrial and Manufacturing Engineering. According to data from OpenAlex, Wenxun Xing has authored 50 papers receiving a total of 466 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Numerical Analysis, 24 papers in Computational Theory and Mathematics and 18 papers in Industrial and Manufacturing Engineering. Recurrent topics in Wenxun Xing's work include Advanced Optimization Algorithms Research (26 papers), Optimization and Variational Analysis (16 papers) and Scheduling and Optimization Algorithms (13 papers). Wenxun Xing is often cited by papers focused on Advanced Optimization Algorithms Research (26 papers), Optimization and Variational Analysis (16 papers) and Scheduling and Optimization Algorithms (13 papers). Wenxun Xing collaborates with scholars based in China, United States and Taiwan. Wenxun Xing's co-authors include Shu‐Cherng Fang, Jiawei Zhang, David Yang Gao, Zhenbo Wang, Cheng Lü, Kokin Lam, Ruey-Lin Sheu, Zhibin Deng, Fengshan Bai and Ning Ruan and has published in prestigious journals such as European Journal of Operational Research, International Journal of Operations & Production Management and Computers & Mathematics with Applications.

In The Last Decade

Wenxun Xing

44 papers receiving 401 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Wenxun Xing China 12 208 176 173 87 86 50 466
L. G. Casado Spain 14 115 0.6× 238 1.4× 155 0.9× 33 0.4× 98 1.1× 60 511
Giacomo Zambelli Italy 10 135 0.6× 232 1.3× 68 0.4× 42 0.5× 50 0.6× 24 410
Christian Michelot France 11 110 0.5× 155 0.9× 104 0.6× 35 0.4× 29 0.3× 27 446
István Maros United Kingdom 10 39 0.2× 157 0.9× 167 1.0× 61 0.7× 45 0.5× 25 347
Yasutoshi Yajima Japan 9 47 0.2× 261 1.5× 286 1.7× 137 1.6× 25 0.3× 22 395
Takahito Kuno Japan 16 118 0.6× 479 2.7× 529 3.1× 274 3.1× 50 0.6× 48 791
Nilotpal Chakravarti India 9 63 0.3× 79 0.4× 54 0.3× 58 0.7× 58 0.7× 16 381
Phan Thiên Thach Vietnam 10 58 0.3× 290 1.6× 285 1.6× 92 1.1× 26 0.3× 27 407
Hong-Xuan Huang China 11 52 0.3× 288 1.6× 219 1.3× 193 2.2× 28 0.3× 18 445
Daniel E. Steffy United States 8 100 0.5× 183 1.0× 77 0.4× 50 0.6× 113 1.3× 16 388

Countries citing papers authored by Wenxun Xing

Since Specialization
Citations

This map shows the geographic impact of Wenxun Xing's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Wenxun Xing with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Wenxun Xing more than expected).

Fields of papers citing papers by Wenxun Xing

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Wenxun Xing. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Wenxun Xing. The network helps show where Wenxun Xing may publish in the future.

Co-authorship network of co-authors of Wenxun Xing

This figure shows the co-authorship network connecting the top 25 collaborators of Wenxun Xing. A scholar is included among the top collaborators of Wenxun Xing based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Wenxun Xing. Wenxun Xing is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lü, Cheng, Zhibin Deng, Shu‐Cherng Fang, & Wenxun Xing. (2023). A New Global Algorithm for Max-Cut Problem with Chordal Sparsity. Journal of Optimization Theory and Applications. 197(2). 608–638.
2.
Deng, Zhibin, Ye Tian, Cheng Lü, & Wenxun Xing. (2017). Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming. Journal of Industrial and Management Optimization. 14(2). 625–636. 4 indexed citations
3.
Xia, Yong, Ruey-Lin Sheu, Shu-Cherng Fang, & Wenxun Xing. (2016). Double well potential function and its optimization in the <inline-formula><tex-math id="M1">\begin{document}$N$\end{document}</tex-math></inline-formula> -dimensional real space-part Ⅱ. Journal of Industrial and Management Optimization. 13(3). 1307–1328. 6 indexed citations
4.
Fang, Shu‐Cherng, et al.. (2016). Double well potential function and its optimization in the <inline-formula><tex-math id="M1">\begin{document}$N$\end{document}</tex-math></inline-formula>-dimensional real space-part Ⅰ. Journal of Industrial and Management Optimization. 13(3). 1291–1305. 8 indexed citations
5.
Xing, Wenxun, et al.. (2015). A study on several combination problems of classic shop scheduling and shortest path. Theoretical Computer Science. 654. 175–187. 11 indexed citations
6.
Xia, Yong & Wenxun Xing. (2014). Parametric Lagrangian dual for the binary quadratic programming problem. Journal of Global Optimization. 61(2). 221–233. 4 indexed citations
7.
Wang, Ziteng, Shu‐Cherng Fang, & Wenxun Xing. (2013). On constraint qualifications: Motivation, design and inter-relations. Journal of Industrial and Management Optimization. 9(4). 983–1001. 8 indexed citations
8.
Guo, Xiaoling, Zhibin Deng, Shu‐Cherng Fang, & Wenxun Xing. (2013). Quadratic optimization over one first-order cone. Journal of Industrial and Management Optimization. 10(3). 945–963. 4 indexed citations
9.
Deng, Zhibin, et al.. (2013). Exact Computable Representation of Some Second-Order Cone Constrained Quadratic Programming Problems. Journal of the Operations Research Society of China. 1(1). 107–134. 8 indexed citations
10.
Fang, Shu‐Cherng, et al.. (2013). Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming. Journal of Industrial and Management Optimization. 9(3). 703–721. 9 indexed citations
11.
Tian, Ye, Shu‐Cherng Fang, Zhibin Deng, & Wenxun Xing. (2013). Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming. Journal of Industrial and Management Optimization. 9(3). 701–719. 4 indexed citations
12.
Xing, Wenxun, et al.. (2011). A canonical dual approach for solving linearly constrained quadratic programs. European Journal of Operational Research. 218(1). 21–27. 1 indexed citations
13.
Xing, Wenxun, et al.. (2010). Linear Algebra - Theory and Applications.
14.
Wang, Zhenbo, Wenxun Xing, & Shu‐Cherng Fang. (2010). Two-person knapsack game. Journal of Industrial and Management Optimization. 6(4). 847–860. 5 indexed citations
15.
Xing, Wenxun, et al.. (2008). On-line service scheduling. Journal of Scheduling. 12(1). 31–43. 3 indexed citations
16.
Xing, Wenxun, et al.. (2007). A successive approximation algorithm for the multiple knapsack problem. Journal of Combinatorial Optimization. 17(4). 347–366. 8 indexed citations
17.
Xie, Jinxing, et al.. (2004). Minimum deviation algorithm for two-stageno-wait flowshops with parallel machines. Computers & Mathematics with Applications. 47(12). 1857–1863. 22 indexed citations
18.
Xing, Wenxun & Kokin Lam. (2002). Capacitated single machine scheduling and its on-line heuristics. IIE Transactions. 34(11). 991–998. 2 indexed citations
19.
Xing, Wenxun. (2001). On-line A-shaped bin packing problem: models and analysis of heuristics. Journal of Tsinghua University(Science and Technology).
20.
Xing, Wenxun & Jiawei Zhang. (2000). Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics. 103(1-3). 259–269. 73 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026