default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeiping Shen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Bingdi Huang, Peiping Shen:
An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation. Comput. Appl. Math. 43(4): 247 (2024)- [j32]Peiping Shen, Yaping Deng, Yafei Wang:
A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming. J. Comput. Appl. Math. 448: 115900 (2024) - [j31]Yanzhen Zhang, Peiping Shen, Bingdi Huang, Yaping Deng:
An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs. J. Comput. Appl. Math. 450: 116035 (2024) - [j30]Hongwei Yue, Peiping Shen:
Bi-affine scaling iterative method for convex quadratic programming with bound constraints. Math. Comput. Simul. 226: 373-382 (2024) - [j29]Peiping Shen, Yaping Deng, Dianxiao Wu:
A criterion space algorithm for solving linear multiplicative programming problems. Numer. Algorithms 96(4): 1901-1923 (2024) - 2023
- [j28]Peiping Shen, Dianxiao Wu, Yafei Wang:
An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming. J. Comput. Appl. Math. 426: 115100 (2023) - [j27]Peiping Shen
, Dianxiao Wu, Kaimin Wang:
Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound. J. Glob. Optim. 86(2): 303-321 (2023) - [j26]Chunfeng Wang, Wenxin Song, Peiping Shen:
A new bat algorithm based on a novel topology and its convergence. J. Comput. Sci. 66: 101931 (2023) - [j25]Peiping Shen, Yafei Wang, Dianxiao Wu:
A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem. Numer. Algorithms 93(3): 1373-1400 (2023) - [j24]Hongwei Jiao, Wenjie Wang, Li Ge, Peiping Shen, Youlin Shang:
Efficient algorithm for globally computing the min-max linear fractional programming problem. RAIRO Oper. Res. 57(3): 1523-1537 (2023) - 2022
- [j23]Chunfeng Wang, Yaping Deng, Peiping Shen:
A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems. J. Comput. Appl. Math. 407: 114080 (2022) - 2020
- [j22]Peiping Shen, Kaimin Wang, Ting Lu:
Outer space branch and bound algorithm for solving linear multiplicative programming problems. J. Glob. Optim. 78(3): 453-482 (2020) - [j21]Peiping Shen, Bingdi Huang:
Global algorithm for solving linear multiplicative programming problems. Optim. Lett. 14(3): 693-710 (2020)
2010 – 2019
- 2019
- [j20]Peiping Shen, Zeyi Zhu, Xiao Chen:
A practicable contraction approach for the sum of the generalized polynomial ratios problem. Eur. J. Oper. Res. 278(1): 36-48 (2019) - [j19]Peiping Shen, Bingdi Huang, Lufan Wang:
Range division and linearization algorithm for a class of linear ratios optimization problems. J. Comput. Appl. Math. 350: 324-342 (2019) - 2014
- [j18]Peiping Shen, Linpeng Yang, Yanchao Liang:
Range division and contraction algorithm for a class of global optimization problems. Appl. Math. Comput. 242: 116-126 (2014) - 2013
- [j17]Peiping Shen, Weimin Li, Xiaodi Bai:
Maximizing for the sum of ratios of two convex functions over a convex set. Comput. Oper. Res. 40(10): 2301-2307 (2013) - [j16]Peiping Shen, Xiaoai Li:
Branch-reduction-bound algorithm for generalized geometric programming. J. Glob. Optim. 56(3): 1123-1142 (2013) - 2012
- [c1]Li Jin, Rui Wang, Peiping Shen:
Global Optimization for the Sum of Linear Ratios Problem over Convex Feasible Region. ICSI (2) 2012: 512-518 - 2011
- [j15]Peiping Shen, Yuan Ma, Yongqiang Chen:
Global optimization for the generalized polynomial sum of ratios problem. J. Glob. Optim. 50(3): 439-455 (2011)
2000 – 2009
- 2009
- [j14]Peiping Shen, Yongqiang Chen, Yuan Ma:
Solving sum of quadratic ratios fractional programs via monotonic function. Appl. Math. Comput. 212(1): 234-244 (2009) - 2008
- [j13]Peiping Shen, Minna Gu:
A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints. Appl. Math. Comput. 198(1): 1-11 (2008) - [j12]Peiping Shen, Yunpeng Duan, Yuan Ma:
A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints. Appl. Math. Comput. 201(1-2): 514-526 (2008) - [j11]Peiping Shen, Yuan Ma, Yongqiang Chen:
A robust algorithm for generalized geometric programming. J. Glob. Optim. 41(4): 593-612 (2008) - 2007
- [j10]Hongwei Jiao, Peiping Shen:
A note on the paper global optimization of nonlinear sum of ratios. Appl. Math. Comput. 188(2): 1812-1815 (2007) - 2006
- [j9]Peiping Shen, Hongwei Jiao:
Linearization method for a class of multiplicative programming with exponent. Appl. Math. Comput. 183(1): 328-336 (2006) - [j8]Hongwei Jiao, Yunrui Guo, Peiping Shen:
Global optimization of generalized linear fractional programming with nonlinear constraints. Appl. Math. Comput. 183(2): 717-728 (2006) - [j7]Peiping Shen, Hongwei Jiao:
A new rectangle branch-and-pruning approach for generalized geometric programming. Appl. Math. Comput. 183(2): 1027-1038 (2006) - 2005
- [j6]Peiping Shen:
Linearization method of global optimization for generalized geometric programming. Appl. Math. Comput. 162(1): 353-370 (2005) - [j5]Yanjun Wang, Peiping Shen, Zhian Liang:
A branch-and-bound algorithm to globally solve the sum of several linear ratios. Appl. Math. Comput. 168(1): 89-101 (2005) - [j4]Peiping Shen, Yanjun Wang:
A new pruning test for finding all global minimizers of nonsmooth functions. Appl. Math. Comput. 168(2): 739-755 (2005) - [j3]Yuelin Gao, Honggang Xue, Peiping Shen:
A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems. Appl. Math. Comput. 168(2): 1409-1418 (2005) - 2004
- [j2]Peiping Shen, Kecun Zhang:
Global optimization of signomial geometric programming using linear relaxation. Appl. Math. Comput. 150(1): 99-114 (2004) - 2003
- [j1]Peiping Shen, Kecun Zhang, Yanjun Wang:
Applications of interval arithmetic in non-smooth global optimization. Appl. Math. Comput. 144(2-3): 413-431 (2003)
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-08-13 21:48 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:
