Integer programming approaches in mean-risk models
From MaRDI portal
Publication:2493230
DOI10.1007/s10287-005-0038-9zbMath1128.91027OpenAlexW2078361282MaRDI QIDQ2493230
Publication date: 12 June 2006
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-005-0038-9
Related Items (14)
On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty ⋮ Portfolio-optimization models for small investors ⋮ Ellipsoidal buffered area under the curve maximization model with variable selection in credit risk estimation ⋮ A local relaxation method for the cardinality constrained portfolio optimization problem ⋮ Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers ⋮ Kernel search: a new heuristic framework for portfolio selection ⋮ An efficient algorithm for solving convex-convex quadratic fractional programs ⋮ Long-short portfolio optimization under cardinality constraints by difference of convex functions algorithm ⋮ DC programming approaches for discrete portfolio optimization under concave transaction costs ⋮ DC programming approach for portfolio optimization under step increasing transaction costs ⋮ An exact algorithm for factor model in portfolio selection with roundlot constraints ⋮ Comparative issues between linear and non-linear risk measures for non-convex portfolio optimization: evidence from the S&P 500 ⋮ Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs ⋮ Linear vs. quadratic portfolio selection models with hard real-world constraints
This page was built for publication: Integer programming approaches in mean-risk models