On a Local-Search Heuristic for a Class of Tracking Error Minimization Problems in Portfolio Management
暂无分享,去创建一个
[1] Daniel Bienstock,et al. Computational study of a family of mixed-integer quadratic programming problems , 1995, Math. Program..
[2] W. Sharpe. Portfolio Theory and Capital Markets , 1970 .
[3] Yazid M. Sharaiha,et al. Heuristics for cardinality constrained portfolio optimisation , 2000, Comput. Oper. Res..
[4] F. Rendl,et al. A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .
[5] Nigel Meade,et al. A simple algorithm to incorporate transactions costs in quadratic optimisation , 1994 .
[6] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[7] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[8] Yves Crama,et al. Simulated annealing for complex portfolio selection problems , 2003, Eur. J. Oper. Res..
[9] Andrew Rudd,et al. Optimal Selection of Passive Portfolios , 1980 .
[10] Jess Lederman,et al. Global asset allocation : techniques for optimizing portfolio management , 1994 .
[11] John E. Beasley,et al. An evolutionary heuristic for the index tracking problem , 2003, Eur. J. Oper. Res..
[12] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..