Abstract
This chapter provides a global synthesis of the realized results by applying exact and approximate approaches on the portfolio design (PD) problem. The authors introduce an experimental analysis of best approaches based on linear programming and constraint programming techniques, according to the CPU time. Next, a global experiment synthesis of the best approximate approaches based on Simulated Annealing, IDWalk, Tabu Search, GWW, and VNS is realized according to the number of success and the CPU time. First results show that constraint programming with breaking all the detected symmetries is the best as an exact approach, VNS combined with simulated annealing is effective on non-trivial instances of the problem, and simulated annealing is the most effective as a simple local search.
Reference18 articles.
1. Flener, P., Frisch, A. M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., & Walsh, T. (2001). Symmetry in matrix models. Proceedings of the CP’01.Workshop on Symmetry in Constraints, 41-48.
2. Breaking Row and Column Symmetries in Matrix Models
3. Design of Financial CDO Squared Transactions Using Constraint Programming
4. Breaking symmetries in matrix models: A brief overview.;P.Flener;Proceedings of the Tenth Workshop on Automated Reasoning,2003
5. Benhamou, B., & Saïdi, M. R. (2007). Local symmetry breaking during search in CSPs. Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007 Proceedings, 195-209.