Carlo Filippi

Prof. Carlo Filippi


Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 September 2019 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
CFCarlo Filippi
Carlo Filippi
GGG. Guastaroba
G. Guastaroba
M.Grazia SperanzaM.Grazia Speranza
M.Grazia Speranza

23 March 2006 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
ABAlberto Bemporad
Alberto Bemporad
CFCarlo Filippi
Carlo Filippi

1 February 2004 in Computational Geometry
Verified
Journal Article
Closed access
ABAlberto Bemporad
Alberto Bemporad
CFCarlo Filippi
Carlo Filippi
FTFabio D. Torrisi
Fabio D. Torrisi

9 March 2006 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
APAlberto Del Pia
Alberto Del Pia
CFCarlo Filippi
Carlo Filippi

1 May 2017 in Computers & Operations Research
Verified
Journal Article
Closed access
CFCarlo Filippi
Carlo Filippi
Renata MansiniRenata Mansini
Renata Mansini
ESElisa Stevanato
Elisa Stevanato

1 December 2016 in Omega
Verified
Journal Article
Open access
CFCarlo Filippi
Carlo Filippi
GGG. Guastaroba
G. Guastaroba
M.Grazia SperanzaM.Grazia Speranza
M.Grazia Speranza
The index tracking problem is the problem of determining a portfolio of assets whose performance replicates, as closely as possible, that of a financial market index chosen as benchmark. In the enhanced index tracking problem the portfolio is expected to outperform the benchmark with minimal additional risk. In this paper, we study the bi-objective enhanced index tracking problem where two competing objectives, i.e., the expected excess return of the portfolio over the benchmark and the tracking error, are taken into consideration. A bi-objective Mixed Integer Linear Programming formulation for the problem is proposed. Computational results on a set of benchmark instances are given, along with a detailed out-of-sample analysis of the performance of the optimal portfolios selected by the proposed model. Then, a heuristic procedure is designed to build an approximation of the set of Pareto optimal solutions. We test the proposed procedure on a reference set of Pareto optimal solutions. Computational results show that the procedure is significantly faster than the exact computation and provides an extremely accurate approximation