arXiv:2211.17193
공식 코드 · Papers with Code
Metaheuristic Approach to Solve Portfolio Selection Problem
원문 초록
In this paper, a heuristic method based on TabuSearch and TokenRing Search is being used in order to solve the Portfolio Optimization Problem. The seminal mean-variance model of Markowitz is being considered with the addition of cardinality and quantity constraints to better capture the dynamics of the trading procedure, the model becomes an NP-hard problem that can not be solved using an exact method. The combination of three different neighborhood relations is being explored with Tabu Search. In addition, a new constructive method for the initial solution is proposed. Finally, I show how the proposed techniques perform on public benchmarks
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
skfolio: Portfolio Optimization in Python
A Scalable Gradient-Based Optimization Framework for Sparse Minimum-Variance Portfolio Selection
Integrating LLM-Generated Views into Mean-Variance Optimization Using the Black-Litterman Model
Diffusion Factor Models: Generating High-Dimensional Returns with Factor Structure
Semi-Decision-Focused Learning with Deep Ensembles: A Practical Framework for Robust Portfolio Optimization
A Deep Reinforcement Learning Framework for Dynamic Portfolio Optimization: Evidence from China's Stock Market
토론
이 논문과 연결된 포럼 글이 아직 없습니다.