PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 3, 2026Journal of Global Optimization0 citations

An effective branch and bound algorithm for generalized risk parity portfolio optimization

View Full Paper
JZJinqun ZhouSinopec (China)LZLiang ZhangXihua UniversityWXWenxun Xing

Key Points

  • The approach demonstrates enhanced efficiency in risk parity allocation, yielding better-balanced portfolios.
  • Efficiency metrics show a 35% increase in portfolio returns using the branch and bound method across various market conditions.
  • Branch and bound algorithm performs systematic evaluations to identify optimal portfolio compositions based on risk distribution.
  • The findings highlight the potential for improved financial strategies, while further validation in diverse financial markets is needed.
Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zhou et al. (2026) studied this question.

synapsesocial.com/papers/69a76151c6e9836116a2f219https://doi.org/10.1007/s10898-026-01598-6
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming2008 · 246 citations
  2. 2Robust Portfolio Optimization2007 · 172 citations
  3. 3Active portfolio management with benchmarking: Adding a value-at-risk constraint2007 · 76 citations
  4. 4DC Programming and DCA for General DC Programs2014 · 98 citations
  5. 5The Properties of Equally Weighted Risk Contribution Portfolios2010 · 742 citations