"Cuckoo Search Algorithms for the Cardinality Portfolio Optimization Problem" Ibrahim Osman, Soha Maad and Karl Sawaya This paper presents Cuckoo Search (CS) Algorithms for solving approximately the cardinality portfolio optimization (CPO) problem. The paper presents a review on existing literature on both CPO and CS to highlight area of concern. A hybrid combination of CS method and an exact method is proposed where CS explores the cardinality search space using Levy flights to select the desired assets while exact method determines the optimal allocation of investments for the selected assets. The main contributions include the introduction of a new mapping between the CS continuous search space and the integer sequencing search space to guide the selection of assets. The CS algorithm is implemented and the obtained results compare favorably to previously published ones on datasets of instances of varying sizes from the literature. The paper concludes with remarks and research directions.