default search action
Wenxun Xing
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Cheng Lu, Jitao Ma, Zhibin Deng
, Wenxun Xing:
A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem. J. Glob. Optim. 88(1): 115-137 (2024) - [j24]Yueyao Li
Globalized distributionally robust optimization based on samples. J. Glob. Optim. 88(4): 871-900 (2024) - [j23]Jintao Xu
Convergence rates of training deep neural networks via alternating minimization methods. Optim. Lett. 18(4): 909-923 (2024) - 2023
- [j22]Cheng Lu, Zhibin Deng
A New Global Algorithm for Max-Cut Problem with Chordal Sparsity. J. Optim. Theory Appl. 197(2): 608-638 (2023) - [i3]Jintao Xu, Yifei Li, Wenxun Xing:
ADMM Training Algorithms for Residual Networks: Convergence, Complexity and Parallel Training. CoRR abs/2310.15334 (2023) - 2022
- [j21]Cheng Lu, Zhibin Deng
Fast computation of global solutions to the single-period unit commitment problem. J. Comb. Optim. 44(3): 1511-1536 (2022) - [i2]Jintao Xu, Chenglong Bao, Wenxun Xing:
Convergence Rates of Training Deep Neural Networks via Alternating Minimization Methods. CoRR abs/2208.14318 (2022) - 2021
- [j20]Pengfei Yu, Ruotian Gao, Wenxun Xing:
Maximizing perturbation radii for robust convex quadratically constrained quadratic programs. Eur. J. Oper. Res. 293(1): 50-64 (2021) - 2020
- [j19]Shan Jiang, Shu-Cherng Fang, Tiantian Nie, Wenxun Xing:
A gradient descent based algorithm for ℓp minimization. Eur. J. Oper. Res. 283(1): 47-56 (2020)
2010 – 2019
- 2017
- [j18]Jing Zhou
Conic approximation to quadratic optimization with linear complementarity constraints. Comput. Optim. Appl. 66(1): 97-122 (2017) - 2016
- [j17]Kameng Nip, Zhenbo Wang
A study on several combination problems of classic shop scheduling and shortest path. Theor. Comput. Sci. 654: 175-187 (2016) - 2015
- [j16]Wenxun Xing, Shu-Cherng Fang, Ruey-Lin Sheu, Liping Zhang:
Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint. Asia Pac. J. Oper. Res. 32(1): 1540007:1-1540007:21 (2015) - [j15]Yong Xia, Wenxun Xing:
Parametric Lagrangian dual for the binary quadratic programming problem. J. Glob. Optim. 61(2): 221-233 (2015) - [c2]Kameng Nip, Zhenbo Wang, Wenxun Xing:
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms. COCOON 2015: 97-108 - 2013
- [j14]Zhibin Deng, Shu-Cherng Fang, Qingwei Jin, Wenxun Xing:
Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme. Eur. J. Oper. Res. 229(1): 21-28 (2013) - [i1]Kameng Nip, Zhenbo Wang, Wenxun Xing:
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms. CoRR abs/1309.0082 (2013) - 2012
- [j13]Wenxun Xing, Shu-Cherng Fang, Ruey-Lin Sheu, Ziteng Wang
A canonical dual approach for solving linearly constrained quadratic programs. Eur. J. Oper. Res. 218(1): 21-27 (2012) - [j12]Zhenbo Wang, Shu-Cherng Fang, David Yang Gao
Canonical dual approach to solving the maximum cut problem. J. Glob. Optim. 54(2): 341-351 (2012) - 2011
- [j11]Cheng Lu, Shu-Cherng Fang, Qingwei Jin, Zhenbo Wang, Wenxun Xing:
KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems. SIAM J. Optim. 21(4): 1475-1490 (2011) - 2010
- [j10]Zhenbo Wang, Wenxun Xing:
Worst-case analysis for on-line service policies. J. Comb. Optim. 19(1): 107-122 (2010) - [j9]Cheng Lu, Zhenbo Wang, Wenxun Xing:
An improved lower bound and approximation algorithm for binary constrained quadratic programming problem. J. Glob. Optim. 48(3): 497-508 (2010) - [j8]Zhenbo Wang, Wenxun Xing, Shu-Cherng Fang:
Two-group knapsack game. Theor. Comput. Sci. 411(7-9): 1094-1103 (2010)
2000 – 2009
- 2009
- [j7]Zhenbo Wang, Wenxun Xing:
A successive approximation algorithm for the multiple knapsack problem. J. Comb. Optim. 17(4): 347-366 (2009) - [j6]Shu-Cherng Fang, David Yang Gao
Global optimization for a class of fractional programming problems. J. Glob. Optim. 45(3): 337-353 (2009) - [j5]Zhenbo Wang, Wenxun Xing, Bo Chen
On-line service scheduling. J. Sched. 12(1): 31-43 (2009) - 2008
- [j4]Zhenbo Wang, Wenxun Xing:
Performance of service policies in a specialized service system with parallel servers. Ann. Oper. Res. 159(1): 451-460 (2008) - 2005
- [j3]Zhenbo Wang, Wenxun Xing, Fengshan Bai:
No-wait flexible flowshop scheduling with no-idle machines. Oper. Res. Lett. 33(6): 609-614 (2005) - 2002
- [j2]Wenxun Xing:
A bin packing problem with over-sized items. Oper. Res. Lett. 30(2): 83-88 (2002) - [c1]Nikhil Garg, Rahul Simha, Wenxun Xing:
Algorithms for budget-constrained survivable topology design. ICC 2002: 2162-2166 - 2000
- [j1]Wenxun Xing, Jiawei Zhang:
Parallel machine scheduling with splitting jobs. Discret. Appl. Math. 103(1-3): 259-269 (2000)
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 2024-11-14 20:55 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: