default search action
Xiaojin Zheng
Person information
- affiliation: Tongji University, Shanghai, China
- affiliation: Fudan University, Shanghai, China
- affiliation: Chinese University of Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j25]Zhongyi Jiang, Baiyi Wu, Qiying Hu, Xiaojin Zheng
:
Cardinality-constrained programs with nonnegative variables and an SCA method. J. Oper. Res. Soc. 73(3): 634-652 (2022) - 2021
- [j24]Xiaojin Zheng, Xueting Cui:
Quadratic convex reformulations for the portfolio selection problem with Value-at-Risk constraint. Comput. Ind. Eng. 152: 106986 (2021) - [j23]Xiaojin Zheng
Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs. INFORMS J. Comput. 33(1): 163-179 (2021) - [j22]Xiaodi Bai
An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems. INFORMS J. Comput. 33(3): 1056-1069 (2021)
2010 – 2019
- 2019
- [c1]Kanghua Chen, Ying Wang, Junwei Zhao, Zhengwei Lyu, Xiaojin Zheng:
Physical-Layer Network Coding for the Downlink of Dual Connectivity Scenarios. ComComAP 2019: 94-99 - 2018
- [j21]Xiaojin Zheng, Yutong Pan, Xueting Cui
Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint. J. Glob. Optim. 70(4): 719-735 (2018) - 2017
- [j20]Xiaojin Zheng, Baiyi Wu, Xueting Cui:
Cell-and-bound algorithm for chance constrained programs with discrete distributions. Eur. J. Oper. Res. 260(2): 421-431 (2017) - [j19]Zhongyi Jiang
Optimality condition and complexity of order-value optimization problems and low order-value optimization problems. J. Glob. Optim. 69(2): 511-523 (2017) - [j18]Baiyi Wu, Xiaoling Sun, Duan Li
Quadratic Convex Reformulations for Semicontinuous Quadratic Programming. SIAM J. Optim. 27(3): 1531-1553 (2017) - 2014
- [j17]Xiaojin Zheng, Xiaoling Sun, Duan Li
Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach. Comput. Optim. Appl. 59(1-2): 379-397 (2014) - [j16]Xiaojin Zheng, Xiaoling Sun, Duan Li
Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach. INFORMS J. Comput. 26(4): 690-703 (2014) - 2013
- [j15]Shuhui Ji, Xiaojin Zheng, Xiaoling Sun:
An Improved Convex 0-1 quadratic Program Reformulation for Chance-Constrained quadratic Knapsack Problems. Asia Pac. J. Oper. Res. 30(3) (2013) - [j14]Xueting Cui, Xiaojin Zheng, Shushang Zhu, Xiaoling Sun:
Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems. J. Glob. Optim. 56(4): 1409-1423 (2013) - [j13]Xiaojin Zheng, Xiaoling Sun, Duan Li
A note on semidefinite relaxation for 0-1 quadratic knapsack problems. Optim. Methods Softw. 28(4): 930-942 (2013) - 2012
- [j12]Xiaojin Zheng, Xiaoling Sun, Duan Li
Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs. Eur. J. Oper. Res. 221(1): 38-48 (2012) - [j11]Xiaojin Zheng, Xiaoling Sun, Duan Li
On zero duality gap in nonconvex quadratic programming problems. J. Glob. Optim. 52(2): 229-242 (2012) - [j10]Xiaojin Zheng, Xiaoling Sun, Duan Li
On reduction of duality gap in quadratic knapsack problems. J. Glob. Optim. 54(2): 325-339 (2012) - [j9]Xiaojin Zheng, Jing Xu, Jiang Wang, Yang Yang, Xiaoying Zheng, Yong Teng, Kari Horneman:
McPAO: A Distributed Multi-channel Power Allocation and Optimization Algorithm for Femtocells. Mob. Networks Appl. 17(5): 648-661 (2012) - 2011
- [j8]Duan Li
Reachability determination in acyclic Petri nets by cell enumeration approach. Autom. 47(9): 2094-2098 (2011) - [j7]Xiaojin Zheng, Xiaoling Sun, Duan Li
Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations. J. Glob. Optim. 50(4): 695-712 (2011) - [j6]Xiaojin Zheng, Xiaoling Sun, Duan Li
Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation. Math. Program. 129(2): 301-329 (2011) - [j5]Yong Xia, Xiaoling Sun, Duan Li
On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program. SIAM J. Optim. 21(3): 706-729 (2011) - 2010
- [j4]Zishuang Tong, Xiaojin Zheng:
Generalized (, alpha, rho, theta)-d-V-univex functions and non-smooth alternative theorems. Int. J. Comput. Math. 87(1): 158-172 (2010) - [j3]Xiaojin Zheng, Xiaoling Sun, Duan Li
Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming. Math. Oper. Res. 35(4): 864-880 (2010)
2000 – 2009
- 2007
- [j2]Xiaojin Zheng, Zengkun Xu, Cheng Li:
Constraint qualification in a general class of nondifferentiable mathematical programming problems. Comput. Math. Appl. 53(1): 21-27 (2007) - [j1]Zishuang Tong, Xiaojin Zheng:
Constraint qualification in a general class of Lipschitzian mathematical programming problems. J. Glob. Optim. 38(4): 625-635 (2007)
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-04-25 05:51 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: