In this paper we consider two different mixed integer linear programming models for solving the single period portfolio selection problem when integer stock units, transaction costs and a cardinality constraint are taken into account. The first model has been formulated by using the maximization...

In this paper we study a generalization of the Orienteering Problem (OP) which we call the Clustered Orienteering Problem (COP). The OP, also known as the Selective Traveling Salesman Problem, is a problem where a set of potential customers is given and a profit is associated with the service of...

This paper proposes an ex post comparison of portfolio selection strategies. These strategies are applied to a set of assets, preselected among about 10,000 stocks on the global market. The preselection criteria consider the joint Markovian behavior of the returns and their association with the...