.png){kind=icon}
返回
Simulated annealing for complex portfolio selection problems
.png){kind=icon}
OA
AI
DOI：10.1016/S0377-2217(02)00784-1.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes the application of a simulated annealing approach to the solution of a complex portfolio selection model. The model is a mixed integer quadratic programming problem which arises when Markowitz' classical mean-variance model is enriched with additional realistic constraints. Exact optimization algorithms run into difficulties in this framework and this motivates the investigation of heuristic techniques. Computational experiments indicate that the approach is promising for this class of problems. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
finance
simulated annealing
metaheuristics
portfolio selection
quadratic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Incidence of Hepatitis C Infection among Prisoners by Routine Laboratory Values during a 20-Year Period.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏A performance evaluation of a coverage compensation based algorithm for wireless sensor networks
PREAI
分享收藏
查看更多内容