Peiping Shen
Orcid: 0000-0001-5649-911X
According to our database1,
Peiping Shen
authored at least 35 papers
between 2003 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
An adaptive branch-and-bound reduction algorithm for minimizing sum of linear ratios programs.
Comput. Appl. Math., February, 2025
2024
Numer. Algorithms, August, 2024
Bi-affine scaling iterative method for convex quadratic programming with bound constraints.
Math. Comput. Simul., 2024
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., 2024
A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming.
J. Comput. Appl. Math., 2024
An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation.
Comput. Appl. Math., 2024
2023
A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem.
Numer. Algorithms, July, 2023
An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming.
J. Comput. Appl. Math., July, 2023
Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound.
J. Glob. Optim., June, 2023
Efficient algorithm for globally computing the min-max linear fractional programming problem.
RAIRO Oper. Res., May, 2023
J. Comput. Sci., January, 2023
2022
A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems.
J. Comput. Appl. Math., 2022
2020
Optim. Lett., 2020
Outer space branch and bound algorithm for solving linear multiplicative programming problems.
J. Glob. Optim., 2020
2019
Range division and linearization algorithm for a class of linear ratios optimization problems.
J. Comput. Appl. Math., 2019
A practicable contraction approach for the sum of the generalized polynomial ratios problem.
Eur. J. Oper. Res., 2019
2014
Range division and contraction algorithm for a class of global optimization problems.
Appl. Math. Comput., 2014
2013
J. Glob. Optim., 2013
Comput. Oper. Res., 2013
2012
Global Optimization for the Sum of Linear Ratios Problem over Convex Feasible Region.
Proceedings of the Advances in Swarm Intelligence - Third International Conference, 2012
2011
J. Glob. Optim., 2011
2009
Appl. Math. Comput., 2009
2008
A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints.
Appl. Math. Comput., 2008
A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints.
Appl. Math. Comput., 2008
2007
Appl. Math. Comput., 2007
2006
Appl. Math. Comput., 2006
Appl. Math. Comput., 2006
Global optimization of generalized linear fractional programming with nonlinear constraints.
Appl. Math. Comput., 2006
2005
Appl. Math. Comput., 2005
Appl. Math. Comput., 2005
Appl. Math. Comput., 2005
A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems.
Appl. Math. Comput., 2005
2004
Appl. Math. Comput., 2004
2003
Appl. Math. Comput., 2003