Portfolio optimization is a pertinent topic of significant importance in the financial literature. During the portfolio construction, an investor confronts two important steps: portfolio selection and portfolio allocation. This article seeks to investigate portfolio optimization based on the...

The set covering problem is an NP-hard combinatorial optimization problem that arises in applications ranging from crew scheduling in airlines to driver scheduling in public mass transport. In this paper we analyze search space characteristics of a widely used set of benchmark instances through...