A branch-and-bound algorithm for discrete multi-factor portfolio optimization model
From MaRDI portal
Recommendations
- A discrete multi-factor portfolio optimization model with cardinality constraints
- An exact algorithm for factor model in portfolio selection with roundlot constraints
- A branch and bound algorithm for discrete linear portfolio selection problems
- Discrete portfolio optimization with industry constraints and transaction cost
- Application of a portfolio model in the real investment transactions
Cites work
- A minimax portfolio selection rule with linear programming solution
- Computational study of a family of mixed-integer quadratic programming problems
- scientific article; zbMATH DE number 51121 (Why is no real title available?)
- Large-Scale Portfolio Optimization
- Nonlinear integer programming
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
Cited in
(7)- Application of a portfolio model in the real investment transactions
- A discrete multi-factor portfolio optimization model with cardinality constraints
- Threshold accepting approach to improve bound-based approximations for portfolio optimization
- Discrete portfolio optimization with industry constraints and transaction cost
- An exact algorithm for factor model in portfolio selection with roundlot constraints
- A branch and bound algorithm for discrete linear portfolio selection problems
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
This page was built for publication: A branch-and-bound algorithm for discrete multi-factor portfolio optimization model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3538479)