default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJianqiang Cheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Abolhassan Mohammadi Fathabad
, Jianqiang Cheng, Kai Pan, Boshi Yang:
Asymptotically tight conic approximations for chance-constrained AC optimal power flow. Eur. J. Oper. Res. 305(2): 738-753 (2023)- [j18]Jingjing Zhang, Qingwu Yi, Lu Huang, Zihan Yang, Jianqiang Cheng, Heng Zhang:
Research on None-Line-of-Sight/Line-of-Sight Identification Method Based on Convolutional Neural Network-Channel Attention Module. Sensors 23(20): 8552 (2023) - 2022
- [j17]Meysam Cheramin, Jianqiang Cheng, Ruiwei Jiang, Kai Pan:
Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity. INFORMS J. Comput. 34(3): 1768-1794 (2022) - [c8]Lu Huang, Baoguo Yu, Jun Li, Heng Zhang, Xiaohu Liang, Jianqiang Cheng:
A Robust Indoor High-precision Positioning Method Based on Arrayed Pseudolites. IPIN 2022: 1-8 - 2021
- [j16]Roya Karimi, Jianqiang Cheng, Miguel A. Lejeune:
A Framework for Solving Chance-Constrained Linear Matrix Inequality Programs. INFORMS J. Comput. 33(3): 1015-1036 (2021)
2010 – 2019
- 2019
- [j15]Immanuel M. Bomze, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser, Jia Liu:
Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches. Comput. Manag. Sci. 16(4): 593-619 (2019) - [j14]Jianqiang Cheng, Céline Gicquel, Abdel Lisser:
Partial sample average approximation method for chance constrained problems. Optim. Lett. 13(4): 657-672 (2019) - [j13]Lu Huang, Xingli Gan, Baoguo Yu, Heng Zhang, Shuang Li, Jianqiang Cheng, Xiaohu Liang, Boyuan Wang:
An Innovative Fingerprint Location Algorithm for Indoor Positioning Based on Array Pseudolite. Sensors 19(20): 4420 (2019) - 2018
- [j12]Céline Gicquel, Jianqiang Cheng:
A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand. Ann. Oper. Res. 264(1-2): 123-155 (2018) - [j11]Jianqiang Cheng, Richard Li-Yang Chen, Habib N. Najm, Ali Pinar, Cosmin Safta, Jean-Paul Watson:
Chance-constrained economic dispatch with renewable energy and storage. Comput. Optim. Appl. 70(2): 479-502 (2018) - [j10]Jianqiang Cheng, Richard Li-Yang Chen, Habib N. Najm, Ali Pinar, Cosmin Safta, Jean-Paul Watson:
Distributionally Robust Optimization with Principal Component Analysis. SIAM J. Optim. 28(2): 1817-1841 (2018) - [c7]Roya Karimi, Arman Dabiri, Jianqiang Cheng, Eric A. Butcher:
Probabilistic-Robust Optimal Control for Uncertain Linear Time-delay Systems by State Feedback Controllers with Memory. ACC 2018: 4183-4188 - 2017
- [j9]Immanuel M. Bomze, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser:
A fresh CP look at mixed-binary QPs: new formulations and relaxations. Math. Program. 166(1-2): 159-184 (2017) - 2016
- [j8]Jianqiang Cheng, Janny Leung, Abdel Lisser:
New reformulations of distributionally robust shortest path problem. Comput. Oper. Res. 74: 196-204 (2016) - [j7]Jianqiang Cheng, Janny Leung, Abdel Lisser:
Random-payoff two-person zero-sum game with joint chance constraints. Eur. J. Oper. Res. 252(1): 213-219 (2016) - 2015
- [j6]Jianqiang Cheng, Abdel Lisser:
Maximum probability shortest path problem. Discret. Appl. Math. 192: 40-48 (2015) - [j5]Jianqiang Cheng, Michal Houda, Abdel Lisser:
Chance constrained 0-1 quadratic programs using copulas. Optim. Lett. 9(7): 1283-1295 (2015) - [c6]Chuan Xu, Jianqiang Cheng, Abdel Lisser:
A Sampling Method to Chance-constrained Semidefinite Optimization. ICORES 2015: 75-81 - [c5]Chuan Xu, Jianqiang Cheng, Abdel Lisser:
Stochastic Semidefinite Optimization Using Sampling Methods. ICORES (Selected Papers) 2015: 93-103 - 2014
- [j4]Jianqiang Cheng, Erick Delage, Abdel Lisser:
Distributionally Robust Stochastic Knapsack Problem. SIAM J. Optim. 24(3): 1485-1506 (2014) - [c4]Belarmino Nuñez, Pablo Adasme, Ismael Soto, Jianqiang Cheng, Marc Letournel, Abdel Lisser:
A chance constrained approach for uplink wireless OFDMA networks. CSNDSP 2014: 754-757 - 2013
- [j3]Jianqiang Cheng, Abdel Lisser, Marc Letournel:
Distributionally robust stochastic shortest path problem. Electron. Notes Discret. Math. 41: 511-518 (2013) - [j2]Jianqiang Cheng, Abdel Lisser:
A completely positive representation of 0-1 linear programs with joint probabilistic constraints. Oper. Res. Lett. 41(6): 597-601 (2013) - 2012
- [j1]Jianqiang Cheng, Abdel Lisser:
A second-order cone programming approach for linear programs with joint probabilistic constraints. Oper. Res. Lett. 40(5): 325-328 (2012) - [c3]Jianqiang Cheng, Abdel Lisser:
Maximum Probability Problem in Stochastic Programming. CTW 2012: 76-79 - [c2]Jianqiang Cheng, Stefanie Kosuch, Abdel Lisser:
Stochastic Shortest Path Problem with Uncertain Delays. ICORES 2012: 256-264 - [c1]Jianqiang Cheng, Céline Gicquel, Abdel Lisser:
A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs. ISCO 2012: 71-80
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-24 23:03 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:
