Kernel search: a new heuristic framework for portfolio selection
From MaRDI portal
Recommendations
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Kernel search: an application to the index tracking problem
- Heuristics for cardinality constrained portfolio optimization
- Local search techniques for constrained portfolio selection problems
- Heuristic algorithms for the portfolio selection problem with minimum transaction lots
Cites work
- A new ILP-based refinement heuristic for vehicle routing problems
- An Algorithm for Large Zero-One Knapsack Problems
- Core problems in knapsack algorithms
- Heuristic algorithms for the portfolio selection problem with minimum transaction lots
- Heuristics for cardinality constrained portfolio optimization
- Integer programming approaches in mean-risk models
- LP solvable models for portfolio optimization: a classification and computational comparison
- On the effectiveness of scenario generation techniques in single-period portfolio optimization
- Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
- Selecting portfolios with fixed costs and minimum transaction lots
- Semi-absolute deviation rule for mutual funds portfolio selection
Cited in
(28)- Dealing with complex transaction costs in portfolio management
- Portfolio problems with two levels decision-makers: optimal portfolio selection with pricing decisions on transaction costs
- Index tracking with controlled number of assets using a hybrid heuristic combining genetic algorithm and non-linear programming
- An efficient heuristic algorithm for the alternative-fuel station location problem
- Mixed integer linear programming for feature selection in support vector machine
- A heuristic for BILP problems: the single source capacitated facility location problem
- Kernel search: an application to the index tracking problem
- Optimal selection of touristic packages based on user preferences during sports mega-events
- On the utility maximization of the discrepancy between a perceived and market implied risk neutral distribution
- Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand
- Matheuristics: survey and synthesis
- An effective matheuristic for the capacitated total quantity discount problem
- Clustered maximum weight clique problem: algorithms and empirical analysis
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- The multi-visit team orienteering problem with precedence constraints
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
- A mathematical programming approach to overlapping community detection
- K-fold cross validation performance comparisons of six naive portfolio selection rules: how naive can you be and still have successful out-of-sample portfolio performance?
- Index tracking with fixed and variable transaction costs
- A kernel search heuristic for a fair facility location problem
- The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- Kernel technology to solve discrete optimization problems
- A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry
- Twenty years of linear programming based portfolio optimization
- BOOSTING-BASED FRAMEWORK FOR PORTFOLIO STRATEGY DISCOVERY AND OPTIMIZATION
- Water distribution networks design under uncertainty
This page was built for publication: Kernel search: a new heuristic framework for portfolio selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q434181)
